Cell probe lower bounds for succinct data structures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 625-634

  Golynski, Alexander ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DIGITAL STORAGE; INFORMATION THEORY; MATRIX ALGEBRA; PROBES;

BINARY MATRIX; CONSTANT FACTORS; INVERSE ELEMENTS; LOWER BOUNDS; LOWER ORDER TERMS; RECIPROCAL RELATIONS; SEARCH AND RETRIEVAL; SUCCINCT DATA STRUCTURE;

INVERSE PROBLEMS;

EID: 70349122099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.69     Document Type: Conference Paper

References (39)

1. Miklós Ajtai. A lower bound for finding predecessors in yao's cell probe model. Combinatorica, 8(3):235-247, 1988.
2. Jérémy Barbay, Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao. Adaptive searching in succinctly encoded binary relations and tree-structured documents. In Combinatorial Pattern Matching, pages 24-35, 2006.
3. Jérémy Barbay, Meng He, J. Ian Munro, and S. Srinivasa Rao. Succinct indexes for strings, binary relations and multi-labeled trees. In ACM-SIAM Symposium on Discrete Algorithms, pages 680-689, 2007.
4. Paul Beame and Faith Ellen. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38-72, 2002.
5. Erik D. Demaine and Alejandro López-Ortiz. A linear lower bound on index size for text retrieval. In ACM-SIAM Symposium on Discrete Algorithms, pages 289-294, 2001.
6. Erik D. Demaine and Alejandro López-Ortiz. A linear lower bound on index size for text retrieval. Journal of Algorithms, 48(1):2-15, 2003.
7. Martin Farach-Colton. Optimal suffix tree construction with large alphabets. In IEEE Symposium on Foundations of Computer Science, pages 137-143, 1997.
8. Arash Farzan and Ian Munro. Succinct representations of arbitrary graphs (accepted). In ESA, 2008.
9. Paolo Ferragina and Giovanni Manzini. Opportunistic data structures with applications. In Proceedings of 41st Annual IEEE Symposium on Foundations of Computer Science, pages 390-398, 2000.
10. Paolo Ferragina and Giovanni Manzini. An experimental study of an opportunistic index. In ACM-SIAM Symposium on Discrete Algorithms, pages 269-278, 2001.
11. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, and Gonzalo Navarro. An alphabet-friendly FM-index. In Proceedings of the 11th Symposium on String Processing and Information Retrieval, pages 150-160, 2004.
12. Anna Gál and Peter Bro Miltersen. The cell probe complexity of succinct data structures. In International Colloquium on Automata, Languages and Programming, pages 332-344, 2003. (Pubitemid 137636363)
13. Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In IEEE Symposium on Foundations of Computer Science, pages 305-313, 2000. (Pubitemid 32075900)
14. Robert Giegerich and Stefan Kurtz. From ukkonen to mccreight and weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3):331-353, 1997. (Pubitemid 127709320)
15. Alexander Golynski. Upper and Lower Bounds for Text Indexing Data Structures. PhD thesis, University of Waterloo, http://www.cs.uwaterloo.ca/ ~imunro/Golynski.pdf, 2007.
16. Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao. Rank/select operations on large alphabets: a tool for text indexing. In ACM-SIAM Symposium on Discrete Algorithms, pages 368-373, 2006. (Pubitemid 43275258)
17. Roberto Grossi, Ankur Gupta, and Jeffrey Scott Vitter. High-order entropy-compressed text indexes. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 841-850, 2003.
18. Roberto Grossi and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In ACM Symposium on Theory of Computing, pages 397-406, 2000. (Pubitemid 30886398)
19. Roberto Grossi and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal of Computation, 35(2):378-407, 2005.
20. Dan Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. USA: Cambridge University Press, 1997.
21. M.E. Hellman. A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory, 26:401-405, 1980.
22. Juha Kärkkäinen and Peter Sanders. Simple linear work suffix array construction. In International Colloquium on Automata, Languages and Programming, pages 943-955, 2003.
23. P. Vitányi M. Li. An Introduction to Kolmogorov Complexity and its Applications, 2nd edition. Springer-Verlag, New York, 1997
24. Udi Manber and Eugene W. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
25. Edward M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
26. Peter Bro Miltersen. Lower bounds for union-split-find related problems on random access machines. In Symposium on Theory of Computing, pages 625-634, 1994.
27. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, 1998. (Pubitemid 128428156)
28. M.L. Minsky and S.A. Papert. Perceptrons. Cambridge, MA: MIT Press, 1969.
29. J. Ian Munro, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct representations of permutations. In International Colloquium on Automata, Languages and Programming, pages 345-356, 2003.
30. Gonzalo Navarro and Veli Mäkinen. Compressed fulltext indexes. ACM Computing Surveys, 39(1):article 2, 2007.
31. Mihai Pǎtraşcu. Personal communication.
32. Mihai Pǎtraşcu. and Mikkel Thorup. Time-space trade-offs for predecessor search. In Symposium on Theory of Computing, pages 232-240, 2006. (Pubitemid 44306557)
33. Kunihiko Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In International Conference on Algorithms and Computation, pages 410-421, 2000.
34. Kunihiko Sadakane. Succinct representations of lcp information and improvements in the compressed suffix arrays. In ACM-SIAM Symposium on Discrete Algorithms, pages 225-232, 2002.
35. Pranab Sen. Lower bounds for predecessor searching in the cell probe model. In IEEE Conference on Computational Complexity, pages 73-83, 2003.
36. Esko Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
37. P. Weiner. Linear pattern matching algorithms. In IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.
38. Andrew Chi-Chih Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, 1981.
39. Andrew Chi-Chih Yao. Coherent functions and program checkers (extended abstract). In ACM Symposium on Theory of Computing, pages 84-94, 1990.