In this paper we look at a combination of bulk-compression, partial query processing and skipping for document-ordered inverted indexes. We propose a new inverted index organization, and provide an updated version of the MaxScore method by Turtle and Flood and a skipping-adapted version of the space-limited adaptive pruning method by Lester et al. Both our methods significantly reduce the number of processed elements and reduce the average query latency by more than three times. Our experiments with a real implementation and a large document collection are valuable for a further research within inverted index skipping and query processing optimizations.
CITATION STYLE
Jonassen, S., & Bratsberg, S. E. (2011). Efficient compressed inverted index skipping for disjunctive text-queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6611 LNCS, pp. 530–542). Springer Verlag. https://doi.org/10.1007/978-3-642-20161-5_53
Mendeley helps you to discover research relevant for your work.