Variable Length Compression for Bitmap Indices

  title={Variable Length Compression for Bitmap Indices},
  author={Fabian Corrales and David Chiu and Jason Sawin},
Modern large-scale applications are generating staggering amounts of data. In an effort to summarize and index these data sets, databases often use bitmap indices. These indices have become widely adopted due to their dual properties of (1) being able to leverage fast bit-wise operations for query processing and (2) compressibility. Today, two pervasive bitmap compression schemes employ a variation of run-length encoding, aligned over bytes (BBC) and words (WAH), respectively. While BBC… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
16 Citations
24 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 16 extracted citations


Publications referenced by this paper.
Showing 1-10 of 24 references

Notes on design and implementation of compressed bit vectors

  • K. Wu, E. J. Otoo, A. Shoshani, H. Nordberg
  • Technical Report LBNL/PUB-3161, Lawrence Berkeley…
  • 2001
Highly Influential
2 Excerpts

Byte-aligned bitmap compression

  • G. Antoshenkov
  • Proceedings of the Conference on Data Compression…
  • 1995
Highly Influential
4 Excerpts

D . Lemire and O . Kaser . Reordering columns for smaller indexes

  • O. Kaser, K. Aouiche
  • Information Sciences
  • 2011

Similar Papers

Loading similar papers…