Log In Sign Up

Techniques for Inverted Index Compression

by   Giulio Ermanno Pibiri, et al.

The data structure at the core of large-scale search engines is the inverted index, which is essentially a collection of sorted integer sequences called inverted lists. Because of the many documents indexed by such engines and stringent performance requirements imposed by the heavy load of queries, the inverted index stores billions of integers that must be searched efficiently. In this scenario, index compression is essential because it leads to a better exploitation of the computer memory hierarchy for faster query processing and, at the same time, allows reducing the number of storage machines. The aim of this article is twofold: first, surveying the encoding algorithms suitable for inverted index compression and, second, characterizing the performance of the inverted index through experimentation.


page 12

page 30


Compressed Key Sort and Fast Index Reconstruction

In this paper we propose an index key compression scheme based on the no...

On Slicing Sorted Integer Sequences

Representing sorted integer sequences in small space is a central proble...

Airphant: Cloud-oriented Document Indexing

Modern data warehouses can scale compute nodes independently of storage....

Compressing integer lists with Contextual Arithmetic Trits

Inverted indexes allow to query large databases without needing to searc...

Faster Queries on BWT-runs Compressed Indexes

Although a significant number of compressed indexes for highly repetitiv...

ER-index: a referential index for encrypted genomic databases

Huge DBMSs storing genomic information are being created and engineerize...

CPOI: A Compact Method to Archive Versioned RDF Triple-Sets

Large amounts of RDF/S data are produced and published lately, and sever...