Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Storage and Retrieval by Content and Address of Static Files
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compressed Data Structures: Dictionaries and Data-Aware Measures
DCC '06 Proceedings of the Data Compression Conference
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Compressed dictionaries: space measures, data sets, and experiments
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient implementation of rank and select functions for succinct representation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Improved address-calculation coding of integer arrays
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Proceedings of the sixth ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We consider the prefix sumsproblem: given a (static) sequence of positive integers $\vec{x} = (x_1, \ldots, x_n)$, such that $\sum_{i=1}^n x_i = m$, we wish to support the operation ${\sf sum}(\vec{x},j)$, which returns $\sum_{i=1}^{j} x_i$. Our interest is in minimising the space required for storing $\vec{x}$, where `minimal space' is defined according to some compressibility criteria, while supporting sumas rapidly as possible.There are two main compressibility criteria: (a) the succinctspace bound, $B(m, n) = \lceil \log_2 {{m-1}\choose{n-1}} \rceil$ bits, applies to any sequence $\vec{x}$ whose elements add up to m; (b) data-awaremeasures, which depend on the values in $\vec{x}$, and can be lower than the succinct bound for some sequences. Appropriate data-aware measures have been studied extensively in the information retrieval (IR) community [17].We demonstrate a close connection between the data-aware measure that is the best in practice for an important IR application and the succinct bound. We give theoretical solutions that use space close to other data-aware compressibility measures (often within o(n) bits), and support sumin doubly-logarithmic (or better) time, and experimental evaluations of practical variants thereof.A bit-vectoris a data structure that supports `rank/select' on a bit-string, and is fundamental to succinct and compressed data structures. We describe a new bit-vector that is robust and efficient.