Succinct data structures for flexible text retrieval systems

Journal of Discrete Algorithms

Volumn 5, Issue 1, 2007, Pages 12-22

  Sadakane, Kunihiko ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

idf; Information retrieval; Inverted files; Succinct data structures; Suffix trees; Tf

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS; PROBLEM SOLVING; QUERY PROCESSING; STORAGE ALLOCATION (COMPUTER); TEXT PROCESSING;

INVERSE DOCUMENT FREQUENCY (IDF); INVERTED FILES; SUCCINCT DATA STRUCTURES; SUFFIX TREES; TERM FREQUENCY (TF);

DATA STRUCTURES;

EID: 33947647477     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.03.011     Document Type: Article

References (19)

1. S. Muthukrishnan, Efficient algorithms for document retrieval problems, in: Proc. ACM-SIAM SODA, 2002, pp. 657-666
2. Blumer A., Blumer J., Haussler D., McConnell R., and Ehrenfeucht A. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM 34 3 (1987) 578-595
3. Grossi R., and Vitter J.S. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35 2 (2005) 378-407
4. R. Grossi, A. Gupta, J.S. Vitter, Higher order entropy analysis of compressed suffix arrays, in: DIMACS Workshop on Data Compression in Networks and Applications, 2003, pp. 841-850
5. K. Sadakane, Succinct representations of lcp information and improvements in the compressed suffix arrays, in: Proc. ACM-SIAM SODA, 2002, pp. 225-232
6. Sadakane K. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48 2 (2003) 294-313
7. Ferragina P., and Manzini G. Indexing compressed texts. Journal of the ACM 52 4 (2005) 552-581
8. Salton G., Wong A., and Yang C.S. A vector space model for automatic indexing. Communications of the ACM 18 11 (1975) 613-620
9. Manber U., and Myers G. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22 5 (1993) 935-948
10. P. Weiner, Linear pattern matching algorithms, in: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11
11. M. Farach, Optimal suffix tree construction with large alphabets, in: 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 137-143
12. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge University Press
13. Munro J.I., and Raman V. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing 31 3 (2001) 762-776
14. Munro J.I., Raman V., and Rao S.S. Space efficient suffix trees. Journal of Algorithms 39 2 (2001) 205-222
15. Ferragina P., Manzini G., Mäkinen V., and Navarro G. Succinct representation of sequences. Technical Report TR/DCC-2004-5, Dept. of Computer Science, Univ. of Chile (August 2004). ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/sequences.ps.gz
16. Bender M., and Farach-Colton M. The LCA problem revisited. Proceedings of LATIN. Lecture Notes in Computer Science vol. 1776 (2000), Springer 88-94
17. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-array trees and multisets, in: Proc. ACM-SIAM SODA, 2002, pp. 233-242
18. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time?, in: ACM Symposium on Theory of Computing, 1995, pp. 427-436
19. Hui L. Color set size problem with applications to string matching. Proc. of the 3rd Annual Symposium on Combinatorial Pattern Matching (CPM'92). Lecture Notes in Computer Science vol. 644 (1992), Springer 227-240