Space-efficient data structures for flexible text retrieval systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 14-24

  Sadakane, Kunihiko ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE DOCUMENT FREQUENCY; INVERTED FILES; RANKING QUERIES; SUFFIX-TREES; TERM FREQUENCY; TEXT COLLECTION; TEXT RETRIEVAL SYSTEM; SPACE EFFICIENT;

ALGORITHMS; FORESTRY; INFORMATION RETRIEVAL; TEXT PROCESSING; DATA STRUCTURES; INVERSE PROBLEMS; SEARCH ENGINES; TREES (MATHEMATICS);

DATA STRUCTURES; INFORMATION RETRIEVAL;

EID: 80052136298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_2     Document Type: Conference Paper

References (15)

1. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in Linear Time? In ACM Symposium on Theory of Computing, pages 427-436, 1995.
2. M. Bender and M. Farach-Colton. The LCA Problem Revisited. In Proceedings of LATIN2000, LNCS 1776, pages 88-94, 2000.
3. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578-595, 1987. (Pubitemid 17653424)
4. P. Ferragina and G. Manzini. Opportunistic Data Structures with Applications. In 41st IEEE Symp. on Foundations of Computer Science, pages 390-398, 2000. (Pubitemid 32075908)
5. R. Grossi, A. Gupta, and J. S. Vitter. Higher Order Entropy Analysis of Compressed Suffix Arrays. In DIMACS Workshop on Data Compression in Networks and Applications, March 2002.
6. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. In 32nd ACM Symposium on Theory of Computing, pages 397-406, 2000.
7. L. Hui. Color Set Size Problem with Applications to String Matching. In Proc. of the 3rd Annual Symposium on Combinatorial Pattern Matching (CPM'92), LNCS 644, pages 227-240, 1992.
8. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001. (Pubitemid 34750554)
9. J. I. Munro, V. Raman, and S. Srinivasa Rao. Space Efficient Suffix Trees. Journal of Algorithms, 39(2):205-222, May 2001. (Pubitemid 33668349)
10. S. Muthukrishnan. Efficient Algorithms for Document Retrieval Problems. In Proc. ACM-SIAM SODA, pages 657-666, 2002.
11. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct Indexable Dictionaries with Applications to Encoding k-aray Trees and Multisets. In Proc. ACM-SIAM SODA, pages 233-242, 2002.
12. K. Sadakane. Compressed Text Databases with Efficient Query Algorithms based on the Compressed Suffix Array. In Proceedings of ISAAC'00, number 1969 in LNCS, pages 410-421, 2000. (Pubitemid 33209842)
13. K. Sadakane. Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays. In Proc. ACM-SIAM SODA 2002, pages 225-232, 2002.
14. G. Salton, A. Wong, and C. S. Yang. A Vector Space Model for Automatic Indexing. Communications of the ACM, 18(11):613-620, 1975.
15. P. Weiner. Linear Pattern Matching Algorihms. In Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.