Optimal Indexes for Sparse Bit Vectors

We consider the problem of supporting rank and select operations on a bit vector of length m with n 1-bits. The problem is considered in the succinct index model, where the bit vector is stored in “read-only” memory and an additional data structure, called the index is created during pre-processing to help answer the above queries. We give asymptotically optimal density-sensitive trade-offs, involving both m and n, that relate the size of the index to the number of accesses to the bit vector (and processing time) needed to answer the above queries. The results are particularly interesting for the case where n=o(m).

[1]  Emanuele Viola,et al.  Cell-probe lower bounds for succinct partial sums , 2010, SODA '10.

[2]  Martin E. Hellman,et al.  A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.

[3]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Rajeev Raman,et al.  Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.

[5]  Rajeev Raman,et al.  On the Size of Succinct Indices , 2007, ESA.

[6]  Alexander Golynski.  Optimal lower bounds for rank and select indexes , 2007, Theor. Comput. Sci..

[7]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[8]  Peter Bro Miltersen,et al.  The Cell Probe Complexity of Succinct Data Structures , 2003 .

[9]  Mike P. Papazoglou,et al.  Service-oriented computing: concepts, characteristics and directions , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[10]  Peter Bro Miltersen.  Lower bounds on the size of selection and rank indexes , 2005, SODA '05.

[11]  Fabrizio Luccio,et al.  Structuring labeled trees for optimal succinctness, and beyond , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[12]  Alexander Golynski,et al.  Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures , 2008 .

[13]  Peter Elias,et al.  Efficient Storage and Retrieval by Content and Address of Static Files , 1974, JACM.

[14]  S. Srinivasa Rao,et al.  Succinct indexes for strings, binary relations and multilabeled trees , 2011, TALG.

[15]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[16]  Meng He,et al.  Indexing Compressed Text , 2003 .

[17]  Roberto Grossi,et al.  Squeezing succinct data structures into entropy bounds , 2006, SODA '06.

[18]  Rodrigo González,et al.  Statistical Encoding of Succinct Data Structures , 2006, CPM.

[19]  Naila Rahman,et al.  Rank and Select Operations on Binary Strings , 2016, Encyclopedia of Algorithms.

[20]  Naila Rahman,et al.  Engineering the LOUDS Succinct Tree Representation , 2006, WEA.

[21]  Wing-Kai Hon,et al.  Compressed data structures: dictionaries and data-aware measures , 2006, Data Compression Conference (DCC'06).

[22]  Roberto Grossi,et al.  Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..

[23]  S. Srinivasa Rao,et al.  Succinct indexes for strings, binary relations and multi-labeled trees , 2007, SODA '07.

[24]  Paolo Ferragina,et al.  A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.

[25]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[26]  Anna Gál,et al.  The cell probe complexity of succinct data structures , 2007, Theor. Comput. Sci..

[27]  Fabrizio Luccio,et al.  Compressing and indexing labeled trees, with applications , 2009, JACM.

[28]  David Richard Clark,et al.  Compact pat trees , 1998 .

[29]  Roberto Grossi,et al.  High-order entropy-compressed text indexes , 2003, SODA '03.