Stronger lempel-ziv based compressed text indexing

Algorithmica (New York)

Volumn 62, Issue 1-2, 2012, Pages 54-101

  Arroyuelo, Diego ^a   Navarro, Gonzalo ^b   Sadakane, Kunihiko ^c  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF CHILE   (Chile)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Compressed data structures; Compressed full text indices; Lempel Ziv compression; Text compression

Indexed keywords

AVERAGE SEARCH TIME; CURRENT TRENDS; FULL-TEXT INDEX; FULL-TEXT SEARCH; SEARCH TIME; SELF-INDEX; SPACE COMPLEXITY; SPACE REQUIREMENTS; SUBSTRING; TEXT COMPRESSIONS; TEXT-INDEXING; TEXT-SEARCHING;

COMPUTER APPLICATIONS; COMPUTER SCIENCE;

DATA STRUCTURES;

EID: 84855351717     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9443-8     Document Type: Conference Paper

References (48)

1. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, vol. 1, pp. 85-96. Springer, Berlin (1985)
2. Arroyuelo, D., Navarro, G.: Space-efficient construction of LZ-index. In: Proc. 16th Annual International Symposium on Algorithms and Computation (ISAAC). LNCS, vol. 3827, pp. 1143-1152. Springer, Berlin (2005)
3. Arroyuelo, D., Navarro, G.: A Lempel-Ziv text index on secondary storage. In: Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM). LNCS, vol. 4580, pp. 83-94. Springer, Berlin (2007)
4. Arroyuelo, D., Navarro, G.: Practical approaches to reduce the space requirement of Lempel-Ziv-based compressed text indices. Technical Report TR/DCC-2008-9, Department of Computer Science, University of Chile, 2008. http://www.dcc.uchile.cl/TR/2008/TR-DCC-2008-009.pdf
5. Arroyuelo, D., Navarro, G.: Space-efficient construction of Lempel-Ziv compressed text indexes. Technical Report TR/DCC-2009-2, Department of Computer Science, University of Chile, 2009. http://www.dcc.uchile.cl/TR/2009/TR-DCC- 20090313-002.pdf
6. Arroyuelo, D., Navarro, G., Sadakane, K.: Reducing the space requirement of LZ-index. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM). LNCS, vol. 4009, pp. 319-330. Springer, Berlin (2006)
7. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 680-689 (2007)
8. D. Benoit E. Demaine J.I. Munro R. Raman V. Raman S.S. Rao 2005 Representing trees of higher degree Algorithmica 43 4 275 292 (Pubitemid 43018037)
9. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
10. B. Chazelle 1988 A functional approach to data structures and its use in multidimensional searching SIAM J. Comput. 17 3 427 462
11. Clark, D., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 383-391 (1996)
12. P. Ferragina R. González G. Navarro R. Venturini 2009 Compressed text indexes: from theory to practice! ACM J. Exp. Algorithmics 13 Article 12 30 pages
13. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. 46th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184-196 (2005)
14. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 390-398 (2000) (Pubitemid 32075908)
15. Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 269-278 (2001)
16. P. Ferragina G. Manzini 2005 Indexing compressed text J. ACM 54 4 552 581 (Pubitemid 43078371)
17. P. Ferragina G. Manzini V. Mäkinen 2007 Compressed representations of sequences and full-text indexes ACM Trans. Algorithms 3 2 Article 20
18. Ferragina, P., Navarro, G.: Pizza&Chili Corpus-compressed indexes and their testbeds (2005). http://pizzachili.dcc.uchile.cl
19. T. Gagie 2006 Large alphabets and incompressibility Inform. Process. Lett. 99 6 246 251 (Pubitemid 43974769)
20. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 368-373 (2006) (Pubitemid 43275258)
21. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841-850 (2003)
22. R. Grossi J.S. Vitter 2005 Compressed suffix arrays and suffix trees with applications to text indexing and string matching SIAM J. Comput. 35 2 378 407
23. W.-K. Hon T.W. Lam K. Sadakane W.-K. Sung M. Yiu 2007 A space and time efficient algorithm for constructing compressed suffix arrays Algorithmica 48 1 23 36 (Pubitemid 47136627)
24. Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. In: Proc. 44th Annual Symposium on Foundations of Computer Science (FOCS), pp. 251-260 (2003)
25. Jansson, J., Sadakane, K., Sung, W.-K.: Ultra-succinct representation of ordered trees. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 575-584 (2007)
26. Kärkkäinen, J.: Repetition-based text indexes. PhD thesis, Dept. of CS, University of Helsinki, Finland, 1999
27. Kärkkäinen, J., Ukkonen, E.: Lempel-Ziv parsing and sublinear-size index structures for string matching. In: Proc. 3rd South American Workshop on String Processing (WSP), pp. 141-155 (1996)
28. R. Kosaraju G. Manzini 1999 Compression of low entropy strings with Lempel-Ziv algorithms SIAM J. Comput. 29 3 893 911
29. A. Lempel J. Ziv 1976 On the complexity of finite sequences IEEE Trans. Inform. Theory 22 1 75 81
30. V. Mäkinen G. Navarro 2005 Succinct suffix arrays based on run-length encoding Nord. J. Comput. 12 1 40 66
31. V. Mäkinen G. Navarro 2007 Rank and select revisited and extended Theor. Comp. Sci. 387 3 332 347 (Pubitemid 350001348)
32. V. Mäkinen G. Navarro 2008 Dynamic entropy-compressed sequences and full-text indexes ACM Trans. Algorithms 4 3 Article 32 38 pages
33. U. Manber G. Myers 1993 Suffix arrays: a new method for on-line string searches SIAM J. Comput. 22 5 935 948
34. G. Manzini 2001 An analysis of the Burrows-Wheeler transform J. ACM 48 3 407 430
35. D.R. Morrison 1968 Patricia-practical algorithm to retrieve information coded in alphanumeric J. ACM 15 4 514 534
36. Munro, J.I.: Tables. In: Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). LNCS, vol. 1180, pp. 37-42. Springer, Berlin (1996)
37. Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Proc. 30th International Colloquium on Automata, Languages and Computation (ICALP). LNCS, vol. 2719, pp. 345-356. Springer, Berlin (2003)
38. J.I. Munro V. Raman 2001 Succinct representation of balanced parentheses and static trees SIAM J. Comput. 31 3 762 776 (Pubitemid 34750554)
39. G. Navarro 2004 Indexing text using the Ziv-Lempel trie J. Discrete Algorithms 2 1 87 114
40. G. Navarro 2009 Implementing the LZ-index: theory versus practice ACM J. Exp. Algorithmics 13 Article 2 49 pages
41. G. Navarro V. Mäkinen 2007 Compressed full-text indexes ACM Comput. Surv. 39 1 Article 2
42. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233-242 (2002)
43. Russo, L., Navarro, G., Oliveira, A.: Approximate string matching with Lempel-Ziv compressed indexes. In: Proc. 14th International Symposium on String Processing and Information Retrieval (SPIRE). LNCS, vol. 4726, pp. 264-275. Springer, Berlin (2007)
44. L. Russo A. Oliveira 2007 A compressed self-index using a Ziv-Lempel dictionary Inf. Retr. 5 3 501 513
45. K. Sadakane 2003 New text indexing functionalities of the compressed suffix arrays J. Algorithms 48 2 294 313
46. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1230-1239 (2006) (Pubitemid 43275351)
47. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1-11 (1973)
48. J. Ziv A. Lempel 1978 Compression of individual sequences via variable-rate coding IEEE Trans. Inform. Theory 24 5 530 536 (Pubitemid 8631609)