Abstract
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of queries on s: select(c,j), returning the position in s containing the jth occurrence of c, and rank(c,p), counting how many occurrences of c are found in the first p positions of s. We give matching upper and lower bounds for this problem. The main contribution is to introduce a general technique for proving lower bounds on succinct data structures, that is based on the access patterns of the supported operations, abstracting from the particular operations at hand.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. SODA 2007, pp. 680–689 (2007); Also, full version available in Internet
Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. In: Proc. SODA 2009, pp. 785–794 (2009)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Series in Telecommunications and Signal Processing). Wiley-Interscience, Hoboken (2006)
Demaine, E.D., López-Ortiz, A.: A linear lower bound on index size for text retrieval. J. Algorithms 48(1), 2–15 (2003)
Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theor. Comput. Sci. 372(1), 115–121 (2007)
Gál, A., Bro Miltersen, P.: The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379, 405–417 (2007)
Golynski, A.: Optimal lower bounds for rank and select indexes. TCS 387, 348–359 (2007)
Golynski, A.: Upper and Lower Bounds for Text Indexing Data Structures. PhD Thesis, U. Waterloo (2007)
Golynski, A.: Cell probe lower bounds for succinct data structures. In: Proc. SODA 2009, pp. 625–632 (2009)
Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. SODA 2006, pp. 368–373 (2006)
González, R., Navarro, G.: Statistical encoding of succinct data structures. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 294–305. Springer, Heidelberg (2006)
Grossi, R., Orlandi, A., Raman, R., Rao, S.S.: More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In: Proc. STACS 2009, pp. 517–528 (2009)
Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proc. SODA 2005, pp. 11–12 (2005)
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)
Pǎtraşcu, M.: Succincter. In: Proc. FOCS 2008, pp. 305–313 (2008)
Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries, with applications to representing k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 4 (2007)
Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. SODA 2006, pp. 1230–1239 (2006)
Willard, D.E.: Log-logarithmic worst-case range queries are possible in space Theta(N). IPL 17(2), 81–84 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grossi, R., Orlandi, A., Raman, R. (2010). Optimal Trade-Offs for Succinct String Indexes. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-642-14165-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14164-5
Online ISBN: 978-3-642-14165-2
eBook Packages: Computer ScienceComputer Science (R0)