The Application Of Suffix Tree Clustering Algorithm In Meta Search Engine

With the rapid development of Internet and the communications technology, Web information increases rapidly and has become a huge mass of information space. Search engines become an indispensable tool for the network. Usually, the relevant information that a single search engine can find is not more than half of all information. Through multiple search engines, users can retrieve more comprehensive information which they need, and search engines show the results in the form of a list to the user, who have to select the information which they need from the list, it is very inconvenient to users.Therefore, this article applies suffix tree algorithm to the meta search engines, and designs a meta search engine systems with a clustering algorithm. All the users have to do is to submit only once search request, the meta search engine will conversion the request to the pre-selected search engines, which can return the search results to the cluster processing, create category system and generate labels, finally put the search results to users in the form of categories. It is convenient for users to see a search engine's results in a higher level, which can greatly reduce the number of results and shorten the time required from user queries. Finally, we compare STC algorithm with the traditional clustering algorithm,and prove that the STC algorithm is superior than the traditional clustering algorithm in accuracy and time efficiency.