When Indexing Equals Compression: Experiments with Compressing Suffix Arrays and Applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 629-638

  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

COMPRESSED SUFFIX ARRAYS; FAST SEARCHING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA COMPRESSION; ENCODING (SYMBOLS); MICROPROCESSOR CHIPS; TREES (MATHEMATICS); VECTORS;

DATA STRUCTURES;

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

References (38)

1. Google Inc., http://www.google.com/help/refinesearch.html.
2. The Canterbury Corpus, http://corpus.canterbury.ac.nz.
3. http://www.infor.kanazawa-it.ac.jp/ishii/lhaunix/.
4. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch. The enhanced su x array its applications to genome analysis. WABI 2002.
5. M.I. Abouelhoda, E. Ohlebusch, S. Kurtz. Optimal exact string matching based on su x arrays. SPIRE 2002.
6. H. Arimura, H. Asaka, H. Sakamoto, S. Arikawa. E cient discovery of proximity patterns with su x arrays (extended abstract). CPM 2001.
7. M.A. Bender M. Farach-Colton. The LCA problem revisited. LATIN 2000.
8. J. Bentley, D. Sleator, R. Tarjan, V. Wei. A locally adaptive data compression scheme. Communications of the ACM, 320-330, 1986.
9. A. Brodnik, J. Munro. Membership in Constant Time and Almost-Minimum Space. SIAM Journal on Computing, 5:1627-1640, 1999.
10. B. Chazelle, L.J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1:133-162, 1986.
11. P. Ferragina, G. Manzini. Opportunistic data structures with applications. FOCS 2000.
12. P. Ferragina, G. Manzini. An experimental study of an opportunistic index. SODA 2001.
13. P. Ferragina, G. Manzini. Optimal Compression Boosting in Optimal Linear Time using the Burrows-Wheeler Transform. SODA 2004.
14. R. Giancarlo, M. Sciortino. Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms. CPM 2003.
15. G.H. Gonnet, R.A. Baeza-Yates, T. Snider. New indices for text: PAT trees PAT arrays. Information Retrieval: Data Structures Algorithms, 1992.
16. R. Grossi, A. Gupta, J. S. Vitter. High-order entropy-compressed text indexes. SODA 2003.
17. R. Grossi, J.S. Vitter. Compressed su x arrays su x trees with applications to text indexing string matching (extended abstract). STOC 2000.
18. Dan Gus eld. Algorithms on Strings, Trees Sequences: Computer Science Computational Biology., 1997.
19. G. Jacobson. Space-e cient static trees graphs. FOCS 1989.
20. S. Kurtz. Reducing the Space Requirement of Su x Trees. Software-Practice Experience, 29:1149-1171, 1999.
21. U. Manber, G. Myers. Su x arrays: a new method for on-line string searches. SICOMP, 22(5):935-948, 1993.
22. G. Manzini. An analysis of the Burrows -Wheeler transform. J.ACM, 48(3):407-430, May 2001.
23. E.M. McCreight. A space-economical su x tree construction algorithm. J.ACM, 23(2):262-272, 1976.
24. A. Moffat, J. Zobel. Self-indexing inverted les for fast text retrieval. ACM TOIS, 14(4):349-379, 1996.
25. J. I. Munro, V. Raman. Succinct representation of balanced parentheses, static trees planar graphs. FOCS 1997.
26. J. I. Munro, V. Raman, S. Srinivasa Rao. Space e cient su x trees. J. Algorithms, 39:205-222, 2001.
27. G. Navarro, E. Silva de Moura, M. Neubert, N. Ziviani, R. Baeza-Yates. Adding compression to block addressing inverted indexes. Information Retrieval, 3:49-77, 2000.
28. G. Navarro. The LZ-index: A Text Index Based on the Ziv-Lempel Trie. Manuscript.
29. M. Nelson. Run length encoding/RLE. DataCompression.info, http://www.datacompression.info/RLE.shtml.
30. R. Pagh. Low redundancy in static dictionaries with constant query time. SICOMP, 31:353-363, 2001.
31. R. Raman, V. Raman, S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees multisets. SODA 2002.
32. S. Srinivasa Rao. Time-space trade-offs for compressed su x arrays. IPL, 82(6):307-311, 2002.
33. J. Rissanen G.G. Langdon, Arithmetic coding. IBM J. reserch Develepment, 23(2):149-162, 1979.
34. K. Sadakane. Compressed text databases with e cient query algorithms based on the compressed su x array. ISAAC 2000.
35. K. Sadakane, 2002. Personal Communication.
36. K. Sadakane. Succinct representations of lcp information improvements in the compressed su x arrays. SODA 2002.
37. H.E. Williams, J. Zobel. Compressing integers for fast le access. The Computer Journal, 42(3):193-201, 1999.
38. I.H. Witten, A.Moffat, T.C. Bell. Managing Gigabytes: Compressing Indexing Documents and Images, 1999.