Index Tuning for Efficient Proximity-Enhanced Query Processing
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.
Unable to display preview. Download preview PDF.
- 2.Büttcher, S., Clarke, C.L.A., Lushman, B.: Term proximity scoring for ad-hoc retrieval on very large text collections. In: SIGIR, pp. 621–622 (2006)Google Scholar