SkipBlock: self-indexing for block-based inverted list

Authors:
Stéphane Campinas;Renaud Delbru;Giovanni Tummarello
Affiliations:
Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland and École Pour l'Informatique et les Techniques Avancées, France;Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland;Digital Enterprise Research Institute, National University of Ireland, Galway, Ireland
Venue:
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Year:
2011

Citing 9
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Self-indexing inverted files for fast text retrieval

ACM Transactions on Information Systems (TOIS)
Compressing Relations and Indexes

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Super-Scalar RAM-CPU Cache Compression

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Exploring the duality between skip lists and binary search trees

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Index compression is good, especially for random access

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
On placing skips optimally in expectation

WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Index compression using 64-bit words

Software—Practice & Experience
Compressed perfect embedded skip lists for quick inverted-index lookups

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

In large web search engines the performance of Information Retrieval systems is a key issue. Block-based compression methods are often used to improve the search performance, but current self-indexing techniques are not adapted to such data structure and provide suboptimal performance. In this paper, we present SkipBlock, a self-indexing model for block-based inverted lists. Based on a cost model, we show that it is possible to achieve significant improvements on both search performance and structure's space storage.