| Z. Wu, W. Meng, C.T. Yu, and Z. Li, "Towards a Highly-Scalable and Effective Metasearch Engine," World Wide Web, pp. 386-395, 2001. |
....or to particular topics that are currently discussed at a Web site, these identified Web sites can be recrawled to check if there have been any changes to the pages at the site. 2.2. Metasearching specialized databases This is the easiest way to extend the search coverage of search engines [16] but also a second way to specialize the index to be searched. This is another way to allow the searching of content that is not searched by the major search engines. CompletePlanet [3] estimates the number of searchable databases on the Web to be approximately 200,000. This is too large a number ....
Z. Wu, W. Meng, C. Yu, Z. Li. Towards a HighlyScalable and Effective Metasearch Engine. Tenth International Web Conference, WWW10, Hong Kong, May 1-5, 2001.
....coverage of the Web is small and it may only contain some of the pages relevant to a user query. In order not to miss relevant documents, the user has to visit several search engines individually. A meta search engine is a middleware (or agent) consisting of a number of participant search engines [13, 6]. Each participant search engine maintains its own index and offers some descriptive information (i.e. descriptors) about its index to the meta search engine. The meta search engine records the descriptors and uses them to estimate the relevance of the underlying search engines when a query is ....
....values, which stand for the degree by which one server can differ from others, are given greater weights in the server ranking. Intuitively, larger variance indicates that some more relevant servers can be separated from the irrelevant servers. 4. A recent server ranking method is proposed in [13, 15, 16]. It tries to rank the servers according to the document with the greatest similarity to the query in each server so that the server ranking can guarantee that the most similar documents are always retrieved. For each server, the document with the greatest similarity to the query is supposed to be ....
[Article contains additional citation context not shown here]
Z. Wu, W. Meng, C. T. Yu, and Z. Li. Towards a highly-scalable and effective metasearch engine. In International World Wide Web Conference (WWW10), 2001.
....left out due to space limitation. Experimental results will be presented in Section 6. We conclude the paper in Section 7. 2. RELATED WORK In the last several years, a large number of research papers on issues related to metasearch engines or distributed collections have been published (e.g. [1, 5, 8, 9, 10, 17, 18, 19, 26, 27, 31, 33, 30, 34]) Due to space limitation, we compare our approach only with the existing works which are closest to what is presented here. A classification of different approaches can be found in [22] In [31] it is shown that if databases are ranked in descending order of similarity of the most similar ....
....Proposition 1 cannot be used as is because we cannot afford to search each database and obtain the global similarity of its most similar document. Instead, for each database, we need to estimate the required similarity. Several methods have been proposed to estimate the required similarity [27, 31, 32] (see the Related Work section for a brief review) But these methods were designed to handle only short queries and their estimation accuracy decreases rather significantly when the number of terms in a query increases. For example, when the number of terms in a query increases from 2 to 6, the ....
[Article contains additional citation context not shown here]
Z. Wu, W. Meng, C. Yu, and Z. Li. Towards a Highly-Scalable and Effective Metasearch Engine. WWW10, Hong Kong, May 2001.
No context found.
Z. Wu, W. Meng, C.T. Yu, and Z. Li, "Towards a Highly-Scalable and Effective Metasearch Engine," World Wide Web, pp. 386-395, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC