Author： Beskers Kai Fischer Johannes
Publisher： MDPI
E-ISSN： 1999-4893|7|4|608-620
ISSN： 1999-4893
Source： Algorithms, Vol.7, Iss.4, 2014-11, pp. : 608-620
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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
Related content
Matching the LBO Eigenspace of Non-Rigid Shapes via High Order Statistics
Axioms, Vol. 3, Iss. 3, 2014-07 ,pp. :
Access to resources
Recommend
Methods for Distributed Compressed Sensing
By Sundman Dennis Chatterjee Saikat Skoglund Mikael
Journal of Sensor and Actuator Networks, Vol. 3, Iss. 1, 2013-12 ,pp. :
Compressed Matching in Dictionaries
By Klein Shmuel T. Shapira Dana
Algorithms, Vol. 4, Iss. 1, 2011-03 ,pp. :
Approximate String Matching with Compressed Indexes
By Russo Luís M. S. Navarro Gonzalo Oliveira Arlindo L. Morales Pedro
Algorithms, Vol. 2, Iss. 3, 2009-09 ,pp. :