Elements of information theory
Elements of information theory
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Succinct representations of lcp information and improvements in the compressed suffix arrays
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
The Level Ancestor Problem Simplified
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
On compressing and indexing data
On compressing and indexing data
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of nk-bit integers, k ≤ O(log n), our data structures require asymptotically the same amount of storage as the compressed sequence if compressed using the Lempel-Ziv algorithm. The basic structure supports range sum queries in O(log n) time. With an increase by a constant factor in the storage complexity, the query time can be improved to $O(\frac{\log\log n}{\log\log\log n} + k)$.