On the redundancy of succinct data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5124 LNCS, Issue , 2008, Pages 148-159

  Golynski, Alexander ^a   Raman, Rajeev ^b   Rao, S Srinivasa ^c  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; CONTROL THEORY; FILE ORGANIZATION; INFORMATION THEORY; QUALITY ASSURANCE; REDUNDANCY; RELIABILITY; TECHNICAL PRESENTATIONS; TREES (MATHEMATICS);

ENCODINGS; LOWER BOUNDS; SUCCINCT DATA STRUCTURES; UPPER AND LOWER BOUNDS;

DATA STRUCTURES;

EID: 54249089033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_15     Document Type: Conference Paper

References (22)

1. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th SODA, pp. 680-689 (2007)
2. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R.. Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43, 275-292 (2005)
3. Delpratt. O., Raman, R., Rahman, N.: Engineering succinct DOM. In: Proc. 11th EDBT, pp. 49-60 (2008)
4. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. in: Proc. 46th FOGS, pp. 184-196 (2005)
5. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3. Article 20 (2007)
6. Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552-581 (2005)
7. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372, 115-121 (2007)
8. Gál, A., Bro Miltersen, P.: The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379, 405-417 (2007)
9. Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2, 510-534 (2006)
10. Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387, 348-359 (2007)
11. Golynski, A.: Upper and Lower Bounds for Text indexing Data Structures. PhD thesis, University of Waterloo (2007)
12. Golynski, A., Grossi, R., Gupta, A., Raman, R., Rao, S.S.: On the size of succinct indices. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 371-382. Springer, Heidelberg (2007)
13. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
14. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 378-407 (2005)
15. Jacobson, G.: Space efficient static trees and graphs. In: Proc. 30th FOGS, pp. 549-554 (1989)
16. Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proc. 16th SODA, pp. 11-12 (2005)
17. Munro, J.I.: Tables. In: Chandra, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
18. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th ALENEX, pp. 59-70. SIAM, Philadelphia (2007)
19. Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM J. Computing 31, 353-363 (2001)
20. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th STOC, pp. 232-240 (2006)
21. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries, with applications to representing k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 4, 26 (2007), Article 43
22. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy-compressed bounds. In: Proc. 17th SODA, pp. 1230-1239 (2006)