Squeezing succinct data structures into entropy bounds

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1230-1239

  Sadakane, Kunihiko ^a   Grossi, Roberto ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; ENTROPY; MATHEMATICAL TRANSFORMATIONS;

BINARY STRING; BITS OF SPACE; COMPRESSED DATA STRUCTURES;

DATA STRUCTURES;

EID: 33244455924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109693     Document Type: Conference Paper

References (39)

1. P. Beame and P. E. Fich. Optimal Bounds for the Predecessor Problem. In Proc. ACM STOC, pp. 295-304, 1999.
2. M. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Computer Science, 321(1):5-12, 2004.
3. David Benoit, Erik D. Demaine, J. Ian Munro, and Venkatesh Raman. Representing trees of higher degree. In Proc. WADS, LNCS 1963, pp. 169-180, 1999.
4. J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. K. Wei. A Locally Adaptive Data Compression Scheme. Comm. of the ACM, 29(4):320-330, April 1986.
5. Daniel K. Blandford and Guy E. Blelloch. Compact representations of ordered sets. In Proc. ACM-SIAM SODA, pp. 11-19, 2004.
6. Daniel K. Blandford, Guy E. Blelloch, and Ian A. Kash. Compact representations of separable graphs. In Proc. ACM-SIAM SODA, pp. 679-688, 2003.
7. Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5): 1627-1640, October 1999.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.
9. P. Elias. Interval and Recency Rank Source Coding: Two On-Line Adaptive Variable-Length Schemes. IEEE Trans. Inform. Theory, IT-33(1):3-10, 1987.
10. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Succinct Representation of Sequences. Tr/dcc-2004-5, August 2004. ftp://ftp.dcc.uchile. cl/pub/users/gnavarro/sequences.ps.gz.
11. Paolo Ferragina and Giovanni Manzini. On compressing and indexing data. Journal of the ACM, 2005.
12. P. Ferragina, F. Luccio. G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. Proc. IEEE FOCS, 2005.
13. Anna Gál and Peter Bro Miltersen. The cell probe complexity of succinct data structures. In Proc. ICALP, em LNCS 2719, pp. 332-344, 2003.
14. R. F. Geary, N. Rahman, R. Raman, and V. Raman. A simple optimal representation for balanced parentheses. In Proc. CPM, LNCS 3109, pp. 159-172, 2004.
15. Richard F. Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In Proc. ACM-SIAM SODA, pp. 1-10, 2004.
16. A. Golynski, J.I. Munro, and S.S. Rao. Rank/select operations on large alphabets: A tool for text indexing. In Proc. ACM-SIAM SODA, 2006, to appear.
17. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In Proc. ACM-SIAM SODA, pp. 841-850, 2003.
18. R. Grossi, A. Gupta, and J. S. Vitter. When Indexing Equals Compression: Experiments with Compressing Suffix Arrays and Applications. In Proc. ACM-SIAM SODA, pp. 636-645, 2004.
19. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In Proc. ACM STOC, pp. 397-406, 2000.
20. Also, in SIAM Journal on Computing, 2005.
21. A. Gupta, W.-K. Hon, R. Shah, and J. S. Vitter. Compressed Data Structures: Dictionaries and Data-Aware Measures. Manuscript, 2005.
22. G. Jacobson. Space-efficient static trees and graphs. In Proc. IEEE FOCS, pp. 549-554, 1989.
23. R. Kosaraju and G. Manzini. Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal on Computing, 29(3):893-911, 1999.
24. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer Verlag, 1997.
25. P. B. Miltersen. Lower bounds on the size of selection and rank indexes. In Proc. ACM-SIAM SODA, pp. 11-12, 2005.
26. J. I. Munro. Tables. In Proc. FSTTCS, LNCS 1180, pp. 37-42, 1996.
27. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001.
28. J. I. Munro, V. Raman, and S. S. Rao. Space Efficient Suffix Trees. J. of Algorithms, 39(2):205-222, 2001.
29. J. Ian Munro, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct representations of permutations. In Proc. ICALP, LNCS 2719, pp. 345-356, 2003.
30. J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses and static trees. SIAM J. on Computing, 31(3):762-776, June 2002.
31. J. Ian Munro, Venkatesh Raman, and Adam J. Storm. Representing dynamic binary trees succinctly. In Proc. ACM-SIAM SODA, pp. 529-536, 2001.
32. J. Ian Munro and S. Srinivasa Rao. Succinct representations of functions. In Proc. ICALP, LNCS 3142, pp. 1006-1015, 2004.
33. Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31:353-363, 2001.
34. C. K. Poon and W. K. Yiu. Opportunistic Data Structures for Range Queries. In Proc. COCOON, LNCS 3595, pp. 560-569, 2005.
35. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding fc-ary trees and multisets. In Proc. ACM-SIAM SODA, pp. 233-242, 2002.
36. Rajeev Raman and S. Srinivasa Rao. Succinct dynamic dictionaries and trees. In Proc. ICALP, LNCS 2719, pp. 357-368, 2003.
37. Kunihiko Sadakane. Succinct representations of lcp information and improvements in the compressed suffix arrays. In Proc. ACM-SIAM SODA, pp. 225-232, 2002.
38. Kunihiko Sadakane. New text indexing functionalities of the compressed suffix arrays. J. Algorithms, 48(2):294-313, 2003.
39. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, IT-24(5):530-536, September 1978.