Next Article in Journal
Neural Networks for Muscle Forces Prediction in Cycling
Previous Article in Journal
Eight-Scale Image Contrast Enhancement Based on Adaptive Inverse Hyperbolic Tangent Algorithm
Open AccessArticle

High-Order Entropy Compressed Bit Vectors with Rank/Select

1
Institut für Theoretische Informatik, Karlsruhe Institute of Technology, Kaiserstraße 12, 76131 Karlsruhe, Germany
2
Fakultät für Informatik, Technical University of Dortmund, Otto-Hahn-Straße 14,44227 Dortmund, Germany
*
Author to whom correspondence should be addressed.
Academic Editor: Tak-Wah Lam
Algorithms 2014, 7(4), 608-620; https://doi.org/10.3390/a7040608
Received: 21 August 2014 / Revised: 8 October 2014 / Accepted: 28 October 2014 / Published: 3 November 2014
We 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
Keywords: design and analysis of algorithms; data compression; implementation and testing of algorithms design and analysis of algorithms; data compression; implementation and testing of algorithms
Show Figures

Figure 1

MDPI and ACS Style

Beskers, K.; Fischer, J. High-Order Entropy Compressed Bit Vectors with Rank/Select. Algorithms 2014, 7, 608-620.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop