Adding Compression to Block Addressing Inverted Indexes

  • Authors:

  • Gonzalo Navarro;Edleno Silva De Moura;Marden Neubert;Nivio Ziviani;Ricardo Baeza-Yates

  • Affiliations:

  • Department of Computer Science, Univ. of Chile, Chile. gnavarro@dcc.uchile.cl;Department of Computer Science, Univ. Federal de Minas Gerais, Brazil. edleno@dcc.ufmg.br;Department of Computer Science, Univ. Federal de Minas Gerais, Brazil. marden@dcc.ufmg.br;Department of Computer Science, Univ. Federal de Minas Gerais, Brazil. nivio@dcc.ufmg.br;Department of Computer Science, Univ. of Chile, Chile. rbaeza@dcc.uchile.cl

  • Venue:
  • Information Retrieval
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for efficient, low-overhead text retrieval. Modern text compression techniques can reduce the text to less than 30% of its size and allow searching it directly and faster than the uncompressed text. Inverted index compression obtains significant reduction of its original size at the same processing speed. Block addressing makes the inverted lists point to text blocks instead of exact positions and pay the reduction in space with some sequential text scanning.In this work we combine the three ideas in a single scheme. We present a compressed inverted file that indexes compressed text and uses block addressing. We consider different techniques to compress the index and study their performance with respect to the block size. We compare the index against three separate techniques for varying block sizes, showing that our index is superior to each isolated approach. For instance, with just 4% of extra space overhead the index has to scan less than 12% of the text for exact searches and about 20% allowing one error in the matches.