Skip to main content
SpringerLink
Log in

On the Redundancy of Succinct Data Structures

  • Conference paper
Algorithm Theory – SWAT 2008 (SWAT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5124))

Included in the following conference series:

Abstract

The redundancy of a succinct data structure is the difference between the space it uses and the appropriate information-theoretic lower bound. We consider the problem of representing binary sequences and strings succinctly using small redundancy. We improve the redundancy required to support the important operations of rank and select efficiently for binary sequences and for strings over small alphabets. We also show optimal density-sensitive upper and lower bounds on the redundancy for systematic encodings of binary sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  3. Delpratt, O., Raman, R., Rahman, N.: Engineering succinct DOM. In: Proc. 11th EDBT, pp. 49–60 (2008)

    Google Scholar 

  4. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. 46th FOCS, pp. 184–196 (2005)

    Google Scholar 

  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)

    Google Scholar 

  6. Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552–581 (2005)

    Article  MathSciNet  Google Scholar 

  7. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372, 115–121 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gál, A., Bro Miltersen, P.: The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379, 405–417 (2007)

    Article  MATH  Google Scholar 

  9. Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2, 510–534 (2006)

    Article  MathSciNet  Google Scholar 

  10. Golynski, A.: Optimal lower bounds for rank and select indexes. Theor. Comput. Sci. 387, 348–359 (2007)

    MathSciNet  MATH  Google Scholar 

  11. Golynski, A.: Upper and Lower Bounds for Text Indexing Data Structures. PhD thesis, University of Waterloo (2007)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  13. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841–850 (2003)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  15. Jacobson, G.: Space efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549–554 (1989)

    Google Scholar 

  16. Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proc. 16th SODA, pp. 11–12 (2005)

    Google Scholar 

  17. Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37–42. Springer, Heidelberg (1996)

    Google Scholar 

  18. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th ALENEX, pp. 59–70. SIAM, Philadelphia (2007)

    Google Scholar 

  19. Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM J. Computing 31, 353–363 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th STOC, pp. 232–240 (2006)

    Google Scholar 

  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

    MathSciNet  Google Scholar 

  22. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy-compressed bounds. In: Proc. 17th SODA, pp. 1230–1239 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Google Inc.,  

    Alexander Golynski

  2. Department of Computer Science, University of Leicester, UK

    Rajeev Raman

  3. MADALGO, Department of Computer Science, University of Aarhus, Denmark

    S. Srinivasa Rao

Authors
  1. Alexander Golynski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Srinivasa Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joachim Gudmundsson

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golynski, A., Raman, R., Rao, S.S. (2008). On the Redundancy of Succinct Data Structures. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69903-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69900-2

  • Online ISBN: 978-3-540-69903-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation