Query efficiency prediction for dynamic pruning
Tonellotto Nicola, Ounis Iadh, Macdonald Craig
Information Retrieval
Dynamic pruning strategies are effective yet permit efficient retrieval by pruning - i.e. not fully scoring all postings of all documents matching a given query. However, the amount of pruning possible for a query can vary, resulting in queries with similar properties (query length, total numbers of postings) taking different amounts of time to retrieve search results. In this work, we investigate the causes for inefficient queries, identifying reasons such as the balance between informativeness of query terms, and the distribution of retrieval scores within the posting lists. Moreover, we note the advantages in being able to predict the efficiency of a query, and propose various query efficiency predictors. Using 10,000 queries and the TREC ClueWeb09 category B corpus for evaluation, we find that combining predictors using regression can accurately predict query response time.
Source: 9th Workshop on Large-scale and Distributed Informational Retrieval, LSDS-IR' 11, pp. 3–8, Glasgow, UK, 24-28 October 2011
Publisher: ACM Press, New York, USA
Metrics
Back to previous page
@inproceedings{oai:it.cnr:prodotti:206216,
title = {Query efficiency prediction for dynamic pruning},
author = {Tonellotto Nicola and Ounis Iadh and Macdonald Craig},
publisher = {ACM Press, New York, USA},
doi = {10.1145/2064730.2064734},
booktitle = {9th Workshop on Large-scale and Distributed Informational Retrieval, LSDS-IR' 11, pp. 3–8, Glasgow, UK, 24-28 October 2011},
year = {2011}
}
0000-0002-7427-1001DOIAlso available from
