The major problem with search engine is that of abundance. Users are very impatient. They demand immediate results otherwise they abandon the search and move on to something else. Some times a search may return a very large number of results making it difficult to find the most suitable resources. Users rarely read more than one or two screens of results returned by a search engine even when the query they have posed is short and ambiguous and is not carefully thought out. More and more users are looking to search engines for all kinds of information including the latest news.
Generally we think what is a good answer to a query?
• The good answer to a query is one that is relevant to the user’s information need.
• Search engines typically return ten answers-per-page, where each answer is a short summary of a web document.
• Likely relevance to an information need is approximated by statistical similarity between web documents and the query.
• Users favor search engines that have high precision, that is, those that return relevant answers in the first page of results.
Generally in the searching process of a query that is entered by the user is done by considering the each and every word in the query as a keyword. Then it will compare the all the keywords present in the query with the indexes of a web pages present in the indexer. Fiscal Policy
Instead searching the all indexes entirely for all keywords we have avoid some indexes or part of indexes of a web pages then we can reduce the number of results of a user query. This can be done in the following way.
In the most of cases the query may contain more than two keywords. Generally the first keyword in a query is searched first and than second keyword and so on. If the first keyword found in a particular position in the index of a particular webpage then the second keyword id searched in the right side part of an index of that webpage in which the first key word is found. If at all the second keyword is present in the right part then only the searching of another keyword is continued in same way otherwise the searching of keywords in that particular index is skipped and the web page will not be displayed in the search results of a user query.
Simply if the query contains n number of keywords then the ith keyword must be searched in right side part of the index present in the indexer where the (i-1) th keyword is found.
The conclusion is made that if we are giving the query that contain more then one keywords than it is possible to reduce the number of search results that given by the search engine. That means it returns the web pages which are contain all the keywords present in a query in the same order as like in the query. According to the solution mentioned above if we are entered the query as Indian citizen’ then it will display the web addresses which contain Indian citizen but it will not display the web pages which contain citizen of India. It is not possible to reduce the number of pages in the output of a query which we are given to the search engine if it contains only one keyword.
In future we want implement the suitable algorithm for this solution. And also implement new ranking algorithm which overcomes the problems in the already existed algorithms.