The Compressed Permuterm Index

ACM Transactions on Algorithms

Volumn 7, Issue 1, 2010, Pages

  Ferragina, Paolo ^a   Venturini, Rossano ^b,c  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

^c NONE   (Italy)

Author keywords

Burrows Wheeler transform; Compressed index; Indexing data structure; Permuterm; String dictionary

Indexed keywords

BURROWS WHEELER TRANSFORM; COMPRESSED INDEX; INDEXING DATA STRUCTURE; PERMUTERM; STRING DICTIONARY;

DATA STRUCTURES; INDEXING (OF INFORMATION);

METADATA;

EID: 78650653284     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1868237.1868248     Document Type: Article

References (22)

1. BAEZA-YATES, R., AND GONNET, G. 1996. Fast text searching for regular expressions or automaton searching on tries. J. ACM 43, 6, 915-936.
2. BAEZA-YATES, R., AND RIBEIRO-NETO, B. 1999. Modern Information Retrieval. ACM/Addison-Wesley.
3. BARBAY, J., HE, M., MUNRO, J., AND RAO, S. S. 2007. Succinct indexes for string, binary relations and multi-labeled trees. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 680-689.
4. BENTLEY, J. L., AND SEDGEWICK, R. 1997. Fast algorithms for sorting and searching strings. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 360-369.
5. BOLDI, P., CODENOTTI, B., SANTINI, M., AND VIGNA, S. 2004. Ubicrawler: A scalable fully distributed web crawler. Softw.: Pract. Exper. 34, 8, 711-726.
6. BURROWS, M., ANDWHEELER, D. 1994. A block sorting lossless data compression algorithm. Tech. rep. No. 124, Digital Equipment Corporation.
7. CHAN,H.,HON,W.,LAM, T., AND SADAKANE,K. 2007. Compressed indexes for dynamic text collections. ACM Trans. Algor. 3, 2.
8. FERRAGINA, P., GIANCARLO, R.,MANZINI, G., AND SCIORTINO, M. 2005. Boosting textual compression in optimal linear time. J ACM 52, 688-713.
9. FERRAGINA, P., KOUDAS, N., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2003. Two-dimensional substring indexing. J Compu. Syst. Sci. 66, 4, 763-774.
10. FERRAGINA, P., AND MANZINI, G. 2005. Indexing compressed text. J. ACM 52, 4, 552-581.
11. FERRAGINA, P., MANZINI, G., MÄKINEN, V., AND NAVARRO, G. 2007. Compressed representations of sequences and full-text indexes. ACM Trans. Algo. 3, 2.
12. FERRAGINA, P., AND NAVARRO, G. 2006. Pizza&Chili corpus homepage. http://pizzachili.dcc.uchile.cl/ or http://pizzachili.di.unipi.it/.
13. GARFIELD, E. 1976. The permuterm subject index: An autobiographical review. J. ACM 27, 288-291.
14. GONZÁLEZ, R., AND NAVARRO, G. 2008. Improved dynamic rank-select entropy-bound structures. In Proceedings of the Latin American Symposium on Theoretical Informatics (LATIN). Lecture Notes in Computer Science, vol. 4957, Springer, 374-386.
15. MÄKINEN, V., AND NAVARRO, G. 2008. Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algo. 4, 3.
16. MANNING, C. D., RAGHAVAN, P., AND SCHÜLZE, H. 2008. Introduction to Information Retrieval. Cambridge University Press.
17. MANTACI, S., RESTIVO, A.,ROSONE, G., AND SCIORTINO,M. 2005. An extension of the burrows wheeler transform and applications to sequence comparison and data compression. In Proceedings of Symposium on Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science, vol. 3537. Springer, 178-189.
18. MANZINI, G. 2001. An analysis of the Burrows-Wheeler transform. J. ACM 48, 3, 407-430.
19. NAVARRO, G., AND MÄKINEN, V. 2007. Compressed full text indexes. ACM Comput. Surv. 39, 1.
20. PUGLISI, S., SMYTH, W., AND TURPIN, A. 2007. A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39, 2.
21. SADAKANE, K. 2007. Succinct data structures for flexible text retrieval systems. J. Discr. Algorithms 5, 1, 12-22.
22. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers.