Implementation of Mini-Search Engine

Search Engine can be defined as a program that searches for and identifies items in a database that correspond to keywords or characters specified by the user, used especially for finding particular sites on the Internet. Search engines retrieve information using algorithms such as distance vector algorithm, crawlers, meta-tags, indexing and many such others based on the keywords or queries entered by the user. When the user queries a search engine to locate information, he/she is actually searching through the index that the search engine has created � not actually searching the Web. These indices are giant databases of information that is collected and stored and subsequently searched. This is why sometimes a search on a commercial search engine, such as Yahoo! or Google, returns results that are, in fact, dead links. Since the search results are based on the index, if the index hasn't been updated since a Web page became invalid the search engine treats the page as still an active link even though it no longer is. It will remain that way until the index is updated. The overall goal of this project is to develop a scalable, high performance search engine. The main focus is on the algorithmic challenges in compactly representing a large data-set while supporting fast searches on it. Our intention is to cluster different documents based on subjective similarities and dissimilarities. Our proposed tool ‘Mini Search Engine’ is based on the concept of data mining, page ranking algorithm and word search program. It presents results in different file formats like .pdf, .doc etc. based on the user’s query.