Articolo in rivista, 2019, ENG, 10.1109/TKDE.2019.2911288
Pibiri G.E.; Venturini R.
CNR-ISTI and University of Pisa, Pisa, Italy; CNR-ISTI and University of Pisa, Pisa, Italy;
The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences. However, its compression ratio is usually not competitive with other more sophisticated encoders, especially when the integers to be compressed are small that is the typical case for inverted indexes. This paper shows that the compression ratio of Variable-Byte can be improved by 2× by adopting a partitioned representation of the inverted lists. This makes Variable-Byte surprisingly competitive in space with the best bit-aligned encoders, hence disproving the folklore belief that Variable-Byte is space-inefficient for inverted index compression. Despite the significant space savings, we show that our optimization almost comes for free, given that: we introduce an optimal partitioning algorithm that does not affect indexing time because of its linear-time complexity; we show that the query processing speed of Variable-Byte is preserved, with an extensive experimental analysis and comparison with several other state-of-the-art encoders.
IEEE transactions on knowledge and data engineering (Print) 32 (9), pp. 1812–1823
Compression, indexing, Variable-byte
Venturini Rossano, Pibiri Giulio Ermanno
ISTI – Istituto di scienza e tecnologie dell'informazione "Alessandro Faedo"
ID: 424819
Year: 2019
Type: Articolo in rivista
Creation: 2020-07-02 11:54:26.000
Last update: 2021-03-25 15:44:32.000
CNR authors
External IDs
CNR OAI-PMH: oai:it.cnr:prodotti:424819
DOI: 10.1109/TKDE.2019.2911288
ISI Web of Science (WOS): 000557696900012
Scopus: 2-s2.0-85090327477