Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20]


Journal of Information Science and Engineering, Vol. 23 No. 2, pp. 353-369 (March 2007)

A Study of Metaindex Mechanisms for Selecting and Ranking Remote Search Engines

Judy C. R. Tseng and Gwo-Jen Hwang+
Department of Computer Science and Information Engineering
Chung Hua University
Hsinchu, 300 Taiwan
+Department of Information and Learning Technology
National University of Tainan
Tainan, 700 Taiwan

With the popularity of computer and network technologies, the number of web sites have rapidly increased, which has significantly stimulated the development of search engines. In recent years, a considerable number of search engines have been developed. The problem of how to find information on the Internet has been replaced with the problems of where to find the search engines, what they are designed to retrieve, and how to make the best use of them. Metasearch engine is a technique to cope with these problems by selecting and interfacing with multiple remote search engines at one time. One important issue on metasearch is how accurately it can select and rank feasible remote search engines for user queries. In this paper, a ratio-based metaindex approach is proposed for selecting remote search engines. Based on the novel approach, an experimental metasearch engine has been implemented. Some experimental results have shown that the accuracy and efficiency of the novel approach are more desirable than the famous metasearch engine SavvySearch.

Keywords: search engine, metasearch engine, metaindex, Internet technology, world wide web

Full Text () Retrieve PDF document (200703_01.pdf)

Received February 19, 2003; revised June 6, 2003 & August 1, 2006; accepted November 30, 2006.
Communicated by David H. C. Du.
* Part of this paper has been presented (in Chinese) in the Internet and Distributed Systems Conference, May 11-12, 2000, Tainan, Taiwan, sponsored by National Cheng Kung University, Taiwan, R.O.C.