The Community for Technology Leaders
Green Image
Issue No. 10 - October (2011 vol. 23)
ISSN: 1041-4347
pp: 1555-1568
Vagelis Hristidis , Florida International University, Miami
Panagiotis G. Ipeirotis , New York University, New York
Yuheng Hu , Arizona State University, Tempe
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keyword queries, but ranks the query results by date only. However, a user would typically prefer a ranking by relevance, measured by an information retrieval (IR) ranking function. A naive approach would be to submit a disjunctive query with all query keywords, retrieve all the returned matching documents, and then rerank them. Unfortunately, such an operation would be very expensive due to the large number of results returned by disjunctive queries. In this paper, we present algorithms that return the top results for a query, ranked according to an IR-style ranking function, while operating on top of a source with a Boolean query interface with no ranking capabilities (or a ranking capability of no interest to the end user). The algorithms generate a series of conjunctive queries that return only documents that are candidates for being highly ranked according to a relevance metric. Our approach can also be applied to other settings where the ranking is monotonic on a set of factors (query keywords in IR) and the source query interface is a Boolean expression of these factors. Our comprehensive experimental evaluation on the PubMed database and a TREC data set show that we achieve order of magnitude improvement compared to the current baseline approaches.
Hidden-web databases, keyword search, top-k ranking.
Vagelis Hristidis, Panagiotis G. Ipeirotis, Yuheng Hu, "Relevance-Based Retrieval on Hidden-Web Text Databases without Ranking Support", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 1555-1568, October 2011, doi:10.1109/TKDE.2010.183
100 ms
(Ver 3.1 (10032016))