The Super Pages Search Engine

Abstract

With the huge growth of websites, the people find difficult to go to every page and waste of time reading every site. A query is formed by the user with a set of keywords that describe their item of interest, and then the search engine returns the pages that include that set of keywords. If a user wants to find information about a topic, the search engine Google will not help much. The user will have to read the   pages that have been returned by the search engine, find related concepts and then issue new queries. For instance, we need to find information about the current economic problems in Europe. A query will return pages on that but not many on the Greek, Italian, Portuguese, and Irish issues specifically. The information returned is too generalized. The user has to form new specific queries to get that in- formation. So a search engine is needed which instead of returning pages in some simple flat list, returns the information in some more structured way. The pages that have relationships between elements that they contain or similarities of some kind should represent one group of links or one category. All these ideas are implemented in”The SUPER PAGES search engine” program .This report describes how the program is done, the experiments, the algorithm is used and the problems encountered during the work.

Keywords: Jaccard, Super search engine, index, stop words, similarity