High-Order Entropy Compressed Bit Vectors with Rank/Select
AbstractWe design practical implementations of data structures for compressing bit-vectors to support efficient rank-queries (counting the number of ones up to a given point). Unlike previous approaches, which either store the bit vectors plainly, or focus on compressing bit-vectors with low densities of ones or zeros, we aim at low entropies of higher order, for example 101010...10. Our implementations achieve very good compression ratios, while showing only a modest increase in query time. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Beskers, K.; Fischer, J. High-Order Entropy Compressed Bit Vectors with Rank/Select. Algorithms 2014, 7, 608-620.
Beskers K, Fischer J. High-Order Entropy Compressed Bit Vectors with Rank/Select. Algorithms. 2014; 7(4):608-620.Chicago/Turabian Style
Beskers, Kai; Fischer, Johannes. 2014. "High-Order Entropy Compressed Bit Vectors with Rank/Select." Algorithms 7, no. 4: 608-620.