I/O-efficient compressed text indexes: From theory to practice

Data Compression Conference Proceedings

Volumn , Issue , 2010, Pages 426-434

  Chiu, Sheng Yuan ^a   Hon, Wing Kai ^a   Shah, Rahul ^b   Vitter, Jeffrey Scott ^c  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b Louisiana State University   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BURROWS WHEELER TRANSFORM; EXTERNAL MEMORY; FUNDAMENTAL FIELD; INDEX STRUCTURE; K-D TREE; LOWER BOUNDS; MEMORY INDEX; MEMORY MODELS; ORDER OF MAGNITUDE; QUERY TIME; R-TREES; SPACE CONSUMPTION; SUFFIX ARRAYS; SUFFIX-TREES; TEXT DATA; TEXT INDICES; TEXT-INDEXING;

DECISION TREES; INDEXING (OF INFORMATION); PATTERN MATCHING;

DATA COMPRESSION;

EID: 77952787114     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2010.45     Document Type: Conference Paper

References (28)

1. P. K. Agarwal and J. Erickson. Geometric Range Searching and Its Relatives. Advances in Discrete and Computational Geometry, 23:1-56, 1999.
2. L. Arge, M. de Berg, H. J. Haverkort, K. Yi. The Priority R-tree: A Practically Efficient and Worst-Case Optimal R-tree. ACM Transactions on Algorithms, 4(1), 2008.
3. L. Arge and J. S. Vitter. Optimal External Memory Interval Management. SIAM Journal on Computing, 32(6):1488-1508, 2003.
4. D. Arroyuelo and G. Navarro. A Lempel-Ziv Text Index on Secondary Storage. In Proceedings of Symposium on Combinatorial Pattern Matching, pages 83-94, 2007.
5. S. J. Bedathur and J. R. Haritsa. Engineering a Fast Online Persistent Suffix Tree Construction. In Proceedings of International Conference on Data Engineering, 2004.
6. M. Burrows and D. J. Wheeler. A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, CA, USA, 1994.
7. B. Chazelle. Lower Bounds for Orthogonal Range Searching, I: The Reporting Case. Journal of the ACM, 37(2):200-212, 1990. (Pubitemid 20696132)
8. Y.-F. Chien, W.-K. Hon, R. Shah, and J. S. Vitter. Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing. In Proceedings of Data Compression Conference, pages 252-261, 2008.
9. P. Ferragina and R. Grossi. The String B-tree: A New Data Structure for String Searching in External Memory and Its Application. Journal of the ACM, 46(2):236-280, 1999.
10. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring Labeled Trees for Optimal Succinctness, and Beyond. In Proceedings of Foundations of Computer Science, pages 184-196, 2005.
11. P. Ferragina and G. Manzini. Indexing Compressed Text. Journal of the ACM, 52(4):552-581, 2005.
12. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms, 3(2), 2007.
13. R. Grossi, A. Gupta, and J. S. Vitter. High-Order Entropy-Compressed Text Indexes. In Proceedings of Symposium on Discrete Algorithms, pages 841-850, 2003.
14. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing, 35(2):378-407, 2005.
15. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, NY, USA, 1997.
16. J. H. Hellerstein, E. Koustsoupias, and C. H. Papadimitriou. On the Analysis of Indexing Schemes. In Proceedings of Principles of Database Systems, pages 249-256, 1997.
17. W. K. Hon, R. Shah, and J. S. Vitter. Ordered Pattern Matching: Towards Full-Text Retrieval. Technical Report TR-06-008, Department of CS, Purdue University, 2006.
18. K. V. R. Kanth and A. K. Singh. Optimal Dynamic Range Searching in Non-replicating Index Structures. In Proceedings of International Conference on Database Theory, pages 257-276, 1999.
19. D. E. Knuth, J. H. Morris, and V. B. Pratt. Fast Pattern Matching in Strings. SIAM Journal on Computing, 6(2):323-350, 1977.
20. V. Mäkinen and G. Navarro. Position-Restricted Substring Searching. In Proceedings of LATIN, pages 703-714, 2006.
21. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
22. E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
23. G. Navarro and V. Mäkinen. Compressed Full-Text Indexes. ACM Computing Surveys, 39(1), 2007.
24. Pizza&Chili Corpus - Compressed Indexes and their Testbeds. http://pizzachili.di.unipi.it/, 2005.
25. R. Sinha, S. J. Puglisi, A. Moffat, and A. Turpin. Improving Suffix Arrays Locality for Fast Pattern Matching on Disk. In Proceedings of International Conference on Management of Data, pages 661-672, 2008.
26. S. Tata, R. A. Hankins, and J. M. Patel. Practical Suffix Tree Construction. In Proceedings of International Conference on Very Large Data Bases, pages 36-47, 2004.
27. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of Symposium on Switching and Automata Theory, pages 1-11, 1973.
28. J. Ziv and A. Lempel. Compression of Individual Sequences via Variable Length Coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978.