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.
Cite
CITATION STYLE
Campinas, S., Delbru, R., & Tummarello, G. (2011). Skipblock: Self-indexing for block-based inverted list. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6611 LNCS, pp. 555–561). Springer Verlag. https://doi.org/10.1007/978-3-642-20161-5_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
