Recently I start to work on a search engine.
after some Googling on it. I found a paper about Rank-based search engine. It start in 1996 that some search engines like Goolge itself try to priorities the result finding by a query string. The older method called Boolean search that only contain some simple gate like: contain, not contain, and,or. But this new method search the words and then try sort the result by most relevent documents for visitor. this is exactly the result of our normal reaction for just checking top 10 google result or re-search with new querys.
In the first step it seems very easy to do this. But after you dirty your hand with code, many problems and constrains appear from nowhere: time limit, meaningless words in query, false response, ... .
Right now, I'm just working on it...
after some Googling on it. I found a paper about Rank-based search engine. It start in 1996 that some search engines like Goolge itself try to priorities the result finding by a query string. The older method called Boolean search that only contain some simple gate like: contain, not contain, and,or. But this new method search the words and then try sort the result by most relevent documents for visitor. this is exactly the result of our normal reaction for just checking top 10 google result or re-search with new querys.
In the first step it seems very easy to do this. But after you dirty your hand with code, many problems and constrains appear from nowhere: time limit, meaningless words in query, false response, ... .
Right now, I'm just working on it...
