A novel hybrid index structure for efficient text retrieval

Authors:
Andreas Broschart;Ralf Schenkel
Affiliations:
Universitaet des Saarlandes and Max-Planck-Institut fuer Informatik, Saarbruecken, Germany;Universitaet des Saarlandes and Max-Planck-Institut fuer Informatik, Saarbruecken, Germany
Venue:
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Year:
2011

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
Efficient text proximity search

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Efficient term proximity search with term-pair indexes

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Query processing with precomputed term pair lists can improve efficiency for some queries, but suffers from the quadratic number of index lists that need to be read. We present a novel hybrid index structure that aims at decreasing the number of index lists retrieved at query processing time, trading off a reduced number of index lists for an increased number of bytes to read. Our experiments demonstrate significant cold-cache performance gains of almost 25% on standard benchmark queries.