High-order entropy-compressed text indexes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 841-850

  Grossi, Roberto ^a   Gupta, Ankur ^b   Vitter, Jeffrey Scott ^c  

^a UNIVERSITY OF PISA   (Italy)

^b Duke University   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; AUTOMATIC INDEXING; ENCODING (SYMBOLS); OPTIMIZATION; SPACE TIME ADAPTIVE PROCESSING; TEXT PROCESSING;

COMPRESSED SUFFIX ARRAYS; ENTROPY COMPRESSED TEXT INDEXES; HIGH ORDER TEXT INDEXES;

DATA COMPRESSION;

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

References (21)

1. D. E. Ferguson. Bit-Tree: a data structure for fast file processing. C. ACM, 35(6): 114-120, 1992.
2. P. Ferragina, G. Manzini. Opportunistic data structures with applications. In FOCS, 390-398, 2000.
3. P. Ferragina, G. Manzini, An experimental study of an opportunistic index. In SODA, 269-278, 2001.
4. G. H. Gonnet, R. A. Baeza-Yates, T. Snider. New indices for text: PAT trees and PAT arrays. In Information Retrieval: Data Struct. Algs., 66-82, 1992.
5. http://www.google.com/help/refinesearch.html.
6. R. Grossi, J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In STOC, 397-406, 2000.
7. G. Jacobson. Space-efficient static trees and graphs. In FOCS, 549-554, 1989.
8. T. Luczak, W. Szpankowski. A Suboptimal Lossy Data Compression Based in Approximate Pattern Matching. IEEE Trans. Inform. Theory, 43, 1439-1451, 1997.
9. E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, 1976.
10. U. Manber, G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22:935-948, 1993.
11. D. R. Morrison. PATRICIA-Practical Algorithm To Retrieve Information Coded In Alphanumeric. J. ACM, 15(4):514-534, 1968.
12. J. I. Munro, V. Raman, S. S. Rao. Space efficient suffix trees. J. Algorithms, 39:205-222, 2001.
13. J. I. Munro. Tables. FSTTCS, 16:37-42, 1996.
14. A. Moffat, J. Zobel. Self-indexing inverted files for fast text retrieval. ACM Trans. Informat. Systems, 14(4):349-379, 1996.
15. G. Navarro, E. Silva de Moura, M. Neubert, N. Ziviani, R. Baeza-Yates Adding compression to block addressing inverted indexes. Inform. Retrieval, 3:49-77, 2000.
16. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM J. Comput., 31:353-363, 2001.
17. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In SODA, 233-242, 2002.
18. S. S. Rao. Time-space trade-offs for compressed suffix arrays. IPL, 82(6):307-311, 2002.
19. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In ISAAC, 410-421, 2000.
20. K. Sadakane. Succinct representations of lcp information and improvements in the compressed suffix arrays. In SODA, 2002.
21. I. H. Witten, A. Moffat, T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufman, second edition, 1999.