A categorization theorem on suffix arrays with applications to space efficient text indexes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 23-32

  He, Meng ^a   Munro, J Ian ^a   Rao, S Srinivasa ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; INDEXING (OF INFORMATION); INTEGER PROGRAMMING; PROBLEM SOLVING; QUERY LANGUAGES; TREES (MATHEMATICS); VECTORS;

CARDINALITY QUERIES; CATEGORIZATION; INDEX STRUCTURES; SUFFIX ARRAYS;

THEOREM PROVING;

EID: 20744449294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S. Alstrup, G. S. Brodai, and T. Rauhe. New data structures for orthogonal range searching. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 198-207, 2000.
2. S. Burkhardt and J. Kärkkäinen. Fast light suffix array construction and checking. In Proceedings of the 14th Symposium on Combinatorial Pattern Matching, pages 55-69. Springer-Verlag LNCS 2676, 2003.
3. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
4. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 383-391, 1996.
5. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 390-398, 2000.
6. P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In Proceedings of the 12th An nual ACM-SIAM Symposium on Discrete Algorithms, pages 269-278, 2001.
7. P. Ferragina and G. Manzini. On compressing and indexing data. Technical Report TR-02-01, University of Pisa, 2002.
8. G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. New indices for text: PAT trees and PAT arrays. In W. B. Frakes and R. Baeza-Yates, editors, Information Retrieval: Data Structures & Algorithms, chapter 5, pages 66-82. Prentice-Hall, 1992.
9. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 841-850, 2003.
10. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. Manuscript, http://www.cs.duke.edu/~jsv/Papers/GrV00.text_indexing_slides.ps.gz.
11. R. Grossi and 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, pages 397-406, 2000.
12. D. Harman, E. Fox, R. Baeza-Yates, and W. Lee. Inverted files. In W. B. Frakes and R. Baeza-Yates, editors, Information Retrieval: Data Structures & Algorithms, chapter 3, pages 28-43. Prentice-Hall, 1992.
13. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 549-554, 1989.
14. D. K. Kim, J. S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In Proceedings of the 14th Symposium on Combinatorial Pattern Matching, pages 186-199. Springer-Verlag LNCS 2676, 2003.
15. D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 2nd edition, 1998.
16. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. In Proceedings of the 14th Symposium on Combinatorial Pattern Matching, pages 200-210. Springer-Verlag LNCS 2676, 2003.
17. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
18. J. I. Munro. Succinct data structures. In Proceedings of Workshop on Data Structures, pages 3-7, 1999.
19. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
20. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix arrays. In Proceedings of the 11th International Symposium on Algorithms and Computation, pages 410-421. Springer-Verlag LNCS 1969, 2000.
21. P. Weiner. Linear pattern matching algorithm. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.