Index tuning for efficient proximity-enhanced query processing

Authors:
Andreas Broschart;Ralf Schenkel
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany and Saarland University, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany and Saarland University, Saarbrücken, Germany
Venue:
INEX'09 Proceedings of the Focused retrieval and evaluation, and 8th international conference on Initiative for the evaluation of XML retrieval
Year:
2009

Citing 3
Cited 0

Term proximity scoring for ad-hoc retrieval on very large text collections

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Experiments with Proximity-Aware Scoring for XML Retrieval at INEX 2008

Advances in Focused Retrieval
Efficient text proximity search

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scoring models that make use of proximity information usually improve result quality in text retrieval. Considering that index structures carrying proximity information can grow huge in size if they are not pruned, it is helpful to tune indexes towards space requirements and retrieval quality. This paper elaborates on our approach used for INEX 2009 to tune index structures for different choices of result size k. Our best tuned index structures provide the best CPU times for type A queries among the Efficiency Track participants, still providing at least BM25 retrieval quality. Due to the number of query terms, Type B queries cannot be processed equally performant. To allow for comparison as to retrieval quality with non-pruned index structures, we also depict our results from the Adhoc Track.