An efficient compression code for text databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2633, Issue , 2003, Pages 468-481

  Brisaboa, Nieves R ^a   Iglesias, Eva L ^b   Navarro, Gonzalo ^c   Paramá, José R ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF VIGO   (Spain)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

D ary Huffman coding; Text compression; Text databases

Indexed keywords

ALGORITHMS; DATA COMPRESSION; PATTERN MATCHING;

COMPRESSION METHODS; COMPRESSION TECHNIQUES; HUFFMAN CODING; NATURAL LANGUAGE TEXT; SEQUENTIAL PATTERN MATCHING; TEXT COMPRESSIONS; TEXT DATABASE; UPPER AND LOWER BOUNDS;

CODES (SYMBOLS);

EID: 35248817809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36618-0_33     Document Type: Article

References (18)

1. M. D. Araújo, G. Navarro, and N. Ziviani. Large text searching allowing errors. In R. Baeza-Yates, editor, Proc. 4th South American Workshop on String Processing (WSP'97), pages 2-20. Carleton University Press, 1997.
2. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval Addison-Wesley, 1999.
3. T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice Hall, 1990.
4. D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng., 40(9):1098-1101, September 1952.
5. B. Mandelbrot. An informational theory of the statistical structure of language. In Proc. Symp. on Applications of Communication Theory, pages 486-500, 1952.
6. D. Manstetten. Tight bounds on the redundancy of Huffman codes. IEEE Trans. on Information Theory, 38(1):144-151, January 1992.
7. A. Moffat. Word-based text compression. Software - Practice and Experience, 19(2):185-198, 1989.
8. A. Moffat and A. Turpin. On the implementation of minimum-redundancy prefix codes. In Proc. Data Compression Conference, pages 170-179, 1996.
9. G. Navarro, E. Silva de Moura, M. Neubert, N. Ziviani, and R. Baeza-Yates. Adding compression to block addressing inverted indexes. Information Retrieval, 3(1):49-77, 2000.
10. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings - Practical online search algorithms for texts and biological sequences. Cambridge University Press, 2002.
11. G. Navarro and J. Tarhio. Boyer-moore string matching over ziv-lempel compressed text. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'2000), LNCS 1848, pages 166-180, 2000.
12. R. De Prisco and A. De Santis. On lower bounds for the redundancy of optimal codes. Designs, Codes and Cryptography, 15(1):29-45, 1998.
13. E. Silva de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2):113-139, April 2000.
14. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Morgan Kaufmann Publishers, second edition, 1999.
15. G. Zipf. Human Behaviour and the Principle of Least Effort. Addison-Wesley, 1949.
16. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3):337-343, 1977.
17. J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978.
18. N. Ziviani, E. Silva de Moura, G. Navarro, and R. Baeza-Yates. Compression: A key for next-generation text retrieval systems. IEEE Computer, 33(11):37-44, 2000.