A linear lower bound on index size for text retrieval

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 2-15

  Demaine, Erik D ^a   López Ortiz, Alejandro ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); RESPONSE TIME (COMPUTER SYSTEMS); SEARCH ENGINES; WORLD WIDE WEB;

SUBSTRING SEARCHES;

INFORMATION RETRIEVAL SYSTEMS;

EID: 10744228787     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00043-9     Document Type: Conference Paper

References (16)

1. [BMRS00] H. Buhrman, P.B. Miltersen, J. Radhakrishnan, V. Srinivasan, Are bitvectors optimal? in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, May, 2000, pp. 449-458.
2. [FKS84] M.L. Fredman, J. Komlós, E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. ACM 31 (3) (1984) 538-544.
3. [FM00] P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 390-398.
4. [FM02] P. Ferragina, G. Manzini, On compressing and indexing data, Technical Report TR-02-01, Dipartimento di Informatica, Università di Pisa, 2002.
5. [GK97] R. Giegerich, S. Kurtz, From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction, Algorithmica 19 (3) (1997) 331-353.
6. [GV00] R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, May, 2000, pp. 397-406.
7. [KMP77] D.E. Knuth, J.H. Morris Jr., V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (2) (1977) 323-350.
8. [LV97] M. Li, P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, 2nd edition, Springer-Verlag, New York, 1997.
9. [McC76] E.M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (2) (1976) 262-272.
10. [Mil93] P.B. Miltersen, The bit probe complexity measure revisited, in: P. Enjalbert, A. Finkel, K.W. Wagner (Eds.), Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, February, 1993, pp. 662-671.
11. [Pag01] R. Pagh, Low redundancy in static dictionaries with constant query time, SIAM J. Comput. 31 (2) (2001) 353-363.
12. [Sad00] K. Sadakane, Compressed text databases with efficient query algorithms based on the compressed suffix array, in: Proceedings of the 11th International Symposium on Algorithms and Computation, in: Lecture Notes in Comput. Sci., Vol. 1969, 2000, pp. 410-421.
13. [Sad02] K. Sadakane, Succint representations of lcp information and improvements in the compressed suffix array, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January, 2002, pp. 225-232.
14. [Ukk95] E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (3) (1995) 249-260.
15. [Wei73] P. Weiner, Linear pattern matching algorithm, in: Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Iowa City, IA, 1973, pp. 1-11.
16. [Yao81] A.C.C. Yao, Should tables be sorted? J. Assoc. Comput. Mach. 28 (3) (1981) 615-628.