kindly Read through abstracts,copy edith and give to your surpervisor....
PROJECT TOPIC: WEB SEARCH USING SUFFIX TREE CLUSTERING ALGORITHM
Department: Computer Science
FORMART: MS WORD
PAGES: 90 pages, abstract, chapter 1-5 , APENDIX A source code and APENDIX B output, well reserached and supervised
Get Complete Work
Suffix tree is a compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations of many important string operations. The construction of such a tree for the string takes time and space linear in the length of . Once constructed, several operations can be performed quickly, for instance locating a substring in , locating a substring if a certain number of mistakes are allowed, locating matches for a regular expression pattern etc. Suffix trees also provide one of the first linear-time solutions for the longest common substring problem. These speedups come at a cost: storing a string's suffix tree typically requires significantly more space than storing the string itself. This research work is going to ensure the use suffix algorithm to optimized adequate searching techniques in websites. To get this done, the following methods of data collection are used; interview, questionnaire, and document examination. While secondary sources of information were journals, textbooks, internets and national dailies. To achieve a robust software development, the top-down design approach under the agile software development life cycle was used. This approach contributes immensely in the design which involves using the following technologies: php, css, jquery, and mysql database for the search result database management system. Finally, the system was design and tested working. The results shows that searching techniques involving string manipulation was achieved. It is recommended that knowledgeable IT-oriented staff and adequate staff training should be adopted to ensure durability of the new system.