By Topic

Metasearch Engines and Information Retrieval: Computational Complexity of Ranking Multiple Search Results

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Goldberg, R. ; City Univ. of New York, Flushing ; Taksa, I. ; Spink, A.

This paper analyzes the computational complexity of finding relevant documents on the Web. Given a search query that has n significant terms, relevant documents retrieved by search engines will contain at least a number k of the significant terms. The threshold k chosen will depend on the collection of documents and is determined experimentally upon formation of the collection. Algorithms are then provided to compute a similarity ranking. The fundamental analysis is based on combinatorial theory and theorems providing bounds on the runtime complexity of the algorithms are proven.

Published in:

Information Technology: New Generations, 2008. ITNG 2008. Fifth International Conference on

Date of Conference:

7-9 April 2008