An Efficient Compression Code for Text Databases-Reference-Cited by-同舟云学术

An Efficient Compression Code for Text Databases

Published:2003 Issue: Volume: Page:468-481
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brisaboa Nieves R.,Iglesias Eva L.,Navarro Gonzalo,Paramá José R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36618-0_33

Reference18 articles.

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.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pattern matching algorithms in blockchain for network fees reduction;The Journal of Supercomputing;2024-05-02

2. Natural-Language Text Compression Using Reverse Multi-Delimiter Codes;Cybernetics and Systems Analysis;2024-01

3. NATURAL-LANGUAGE TEXT COMPRESSION USING REVERSE MULTI-DELIMITER CODES;Kibernetyka ta Systemnyi Analiz;2024

4. A scalable approach for index compression using wavelet tree and LZW;International Journal of Information Technology;2022-04-12

5. Smaller Compressed Suffix Arrays†;The Computer Journal;2020-04-13