Research On The Key Technique Of The Meta Search Engine

With the explosive of network information, it is more difficult for people to search information. The emergence of the search engine eased this problem to some degree. Single Search Engines distributed in different fields provide service for people since it first appeared. In the current, the application is still the most widely. But it can't keep up with current staggering development of Web because of its narrow coverage and low efficiency. To change this condition, some of them changed the original method and focused on gathering the information of specialized field. This way is very effective for clear or specialized query.However, this Specialized Search Engine gets high precision in some field just at expense of large retrieval coverage. According to the experts'investigation, the average ratio of some famous searches engine system is below 0.45. It is mainly because different search engines use different scope and algorithms. If we wish to get a relatively comprehensive and accurate search results, multi-search engines should be used in the same time.The Meta Search Engine can enlarge choice scope. It put good foundation to improve high precision. This paper presented the related knowledge of the Meta Search Engine. The main works in this paper were as follows:1,By reading a great deal of article and related document, the paper introduced the theories of the Meta Search Engine, including the development, the classification and the research difficulties. The paper studied the structure principle of the Meta Search Engine and the key technologies which used in the process of the implementation, including the choice of the Member Search Engine and the merging of the returning results. It alto introduced the relative algorithms in these technologies, and then compared the pros and cons of the various algorithms.2,In relation to how to select the Member Search Engine, the paper compared existing methods,analyzed and estimated the performance of each method. For users, they hoped the results returned by the Member Search Engine were more practical. To solve this question, this paper summarized and presented the algorithm of returning useful information on the basis of reading a great deal of documents.3,In relation to the merging of searching results, this paper introduced the relative algorithms elaborately, and then analyzed and compared the algorithms in some function. In the results returned by Member Search Engine, there were a lot of repeated web pages, dated and invalid web pages and advertisement web pages etc. This paper presented the concrete methods to solve these problems. In the question of sorting the returning results, the paper proposed a parallel sorting algorithm which based on the parallel processing mechanism, and then analyzed the algorithm.4,In the system of the Meta Search Engine, the same requests in different time all need to search repeatedly. If we can obtain the information from the last query directly, we can save the searching time. To solve this question, this paper increased a buffer database module at the time of introduced the structure principle of the Meta Search Engine. This paper introduced the structure of the Meta Search Engine which increased the buffer database module, and then designed the imitation experiment of buffer database. Finally, we designed the Meta Search Engine system. In this system, it mainly targeted at the merging of the results returned by the Member Search Engine, i.e. how to delete and sort the returning results. We discussed how to display a great deal of information and other related issues according to the actual application.