Conference Proceedings
Space-limited ranked query evaluation using adaptive pruning
N Lester, A Moffat, W Webber, J Zobel
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics | SPRINGER-VERLAG BERLIN | Published : 2005
DOI: 10.1007/11581062_37
Abstract
Evaluation of ranked queries on large text collections can be costly in terms of processing time and memory space. Dynamic pruning techniques allow both costs to be reduced, at the potential risk of decreased retrieval effectiveness. In this paper we describe an improved query pruning mechanism that offers a more resilient tradeoff between query evaluation costs and retrieval effectiveness than do previous pruning approaches. © Springer-Verlag Berlin Heidelberg 2005.