Advertisement

On the Size of Succinct Indices

  • Alexander Golynski
  • Roberto Grossi
  • Ankur Gupta
  • Rajeev Raman
  • Satti Srinivasa Rao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4698)

Abstract

A succinct data structure occupies an amount of space that is close to the information-theoretic minimum plus an additional term. The latter is not necessarily a lower-order term and, in several cases, completely dominates the space occupancy both in theory and in practice. In this paper, we present several solutions to partially overcome this problem, introducing new techniques of independent interest that allow us to improve over previously known upper and lower bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 38–72 (2002)zbMATHCrossRefGoogle Scholar
  2. 2.
    Brodnik, A., Munro, J.I.: Membership in Constant Time and Almost-Minimum Space. SIAM J. Computing 28, 1627–1640 (1999)zbMATHCrossRefGoogle Scholar
  3. 3.
    Delpratt, O., Rahman, N., Raman, R.: Engineering the LOUDS succinct tree representation. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 134–145. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Gál, A., Miltersen, P.B.: The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379, 405–417 (2007)zbMATHCrossRefGoogle Scholar
  5. 5.
    Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368, 231–246 (2006)zbMATHCrossRefGoogle Scholar
  6. 6.
    Golynski, A.: Optimal lower bounds for rank and select indexes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 370–381. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-SIAM SODA, pp. 841–850. ACM Press, New York (2003)Google Scholar
  8. 8.
    Grossi, R., Gupta, A., Vitter, J.S.: When indexing equals compression: experiments with compressing suffix arrays and applications. In: SODA 2004, pp. 636–645Google Scholar
  9. 9.
    Jacobson, G.: Space efficient static trees and graphs. In: Proc. 30th IEEE Symp. FOCS, pp. 549–554. IEEE Computer Society Press, Los Alamitos (1989)Google Scholar
  10. 10.
    Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proceedings of the ACM-SIAM SODA, pp. 11–12. ACM Press, New York (2005)Google Scholar
  11. 11.
    Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31, 762–776 (2001)zbMATHCrossRefGoogle Scholar
  12. 12.
    Munro, J I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 345–356. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM J. Computing 31, 353–363 (2001)zbMATHCrossRefGoogle Scholar
  14. 14.
    Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th ACM STOC, pp. 232–240. ACM Press, New York (2006)Google Scholar
  15. 15.
    Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries, with applications to representing k-ary trees and multisets. In: ACM-SIAM SODA 2003, pp. 233–242Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Alexander Golynski
    • 1
  • Roberto Grossi
    • 2
  • Ankur Gupta
    • 3
  • Rajeev Raman
    • 4
  • Satti Srinivasa Rao
    • 5
  1. 1.David R. Cheriton School of Computer Science, University of WaterlooCanada
  2. 2.Dipartimento di Informatica, Università di PisaItaly
  3. 3.Butler UniversityUSA
  4. 4.Department of Computer Science, University of LeicesterUK
  5. 5.IT University of CopenhagenDenmark

Personalised recommendations