2013 IEEE 29th International Conference on Data Engineering (ICDE) (2010)
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
Vagelis Hristidis , School of Computing and Information Sciences, Florida International University, Miami, USA
Yuheng Hu , School of Computing and Information Sciences, Florida International University, Miami, USA
Panagiotis G. Ipeirotis , Department of Information, Operations, and Management Sciences; New York University, USA
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. The naive approach would be to submit a disjunctive query with all query keywords, retrieve the returned documents, and then re-rank 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 TREC dataset show that we achieve order of magnitude improvement compared to the current baseline approaches.
Vagelis Hristidis, Yuheng Hu, Panagiotis G. Ipeirotis, "Ranked queries over sources with Boolean query interfaces without ranking support", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 872-875, 2010, doi:10.1109/ICDE.2010.5447918