kindly Read through abstracts,copy edith and give to your surpervisor....
PROJECT TOPIC: WEB SEARCH USING THE SURFIX ALGORITHM
Department: Computer Science
FORMART: MS WORD
PAGES: 82 pages, abstract, chapter 1-5 , APENDIX A source code and APENDIX B output, well reserached and supervised82 pages, abstract, chapter 1-5 , APENDIX A source code and APENDIX B output, well reserached and supervised
Get Complete Work
Web search is a process of searching for documents on the internet using a search technique, Today documents search on the web increase daily as most of the search engine presents to user a single ordered list of documents matching the search query, since most users do not browse past-the first page of the search results, this method of displaying result often limits the effectiveness of the search to most relevance of the first search documents, A suffix tree algorithm provides an alternative to a single ordered list search result by clustering the search results and presenting documents that are similar to each other which are likely to be relevant to the same query. This algorithm makes it easier to search for single ordered list documents through their suffix. This new system will help cluster web search results on the web by allowing the user to issue to a search query and return the result as a set of coherent clusters, searching the web using suffix tree algorithm will efficiently determine documents which share common phrases by defining the nodes in the suffix before initial clustering. This research work will be implemented using an object oriented programming language (OOP) both primary and secondary data collection were made