Off-line dictionary-based compression

Proceedings of the IEEE

Volumn 88, Issue 11, 2000, Pages 1722-1732

  Jesper Larsson, N ^a,b   Moffat, Alistair ^c  

^a LUND UNIVERSITY   (Sweden)

^b Apptus Technologies   (Sweden)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Dictionary based modeling; Hierarchical modeling; Phrase based compression; Text compression

Indexed keywords

EID: 19944392360     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.892708     Document Type: Article

References (25)

1. J. A. Storer, Data Compression: Methods and Theory. Rockville, MD: Computer Science, 1988.
2. R. J. Solomonoff, "A formal theory of inductive inference-Parts I and II." Inform. Control, vol. 7, pp. 1-22 and 224-254, 1964.
3. J. G. Wolff, "An algorithm for the segmentation of an artificial language analogue," Brit. J. Psych., vol. 66, no. 1, pp. 79-90. 1975.
4. _, "Receding of natural language for economy of transmission or storage," Comput. J, vol. 21, pp. 42-44, 1978.
5. F. Rubin, "Experiments in text compression," Commun. ACM, vol. 19, pp. 617-623, Nov. 1976.
6. H. Nakamura and S. Murashima, "Data compression by concatenations of symbol pairs," in Proc. IEEE Int. Symp. Information Theory ana its Applications. Victoria, BC, Canada, Sept. 1996, pp. 496-499.
7. A. Cannane and H. E. Williams, "General-purpose compression for efficient retrieval," Dept. Comput. Sci., RMIT Univ., Melbourne, Australia, Tech. Rep. TR-99-6, June 1999.
8. [81 J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Inform., Theory, vol. IT-24, pp. 530-536, Sept. 1978.
9. V. S. Miller and M. N. Wegman, "Variations on a theme by Ziv and Lempel," in Combinatorial Algorithms on Words, ser. NATO ASI, A. Apostolico and Z. Galil. Hds. New York: Springer-Verlag, 1985, vol. F 12, pp. 131-140.
10. C. G. Nevili-.VIannini: and I. H. Witten, "Compression and explanation using hierarchical grammars," Comput. J., vol. 40, no. 2/3, pp. 103-116, 1997.
11. U. Manber, ;"A text compression scheme that allows fast searching directly in [he compressed file," ACM Trans. Inform. Syst.. vol. 15, pp. 124-136, Apr. 1997.
12. A. Apostolico and S. Lonardi, "Greedy off-line textual substitution," in Proc. IEEE Data Compression Conf., Mar.-Apr. 1998, pp. 119-128.
13. J. L. Bentley and M. D. McIlroy, "Data compression using long common strings," in Proc. IEEE Data. Compression Conf, 1999, pp. 287-295.
14. D. E. Knuth, Sorting and Searching. 2nd ed. Reading, MA: Addison-Wesley, 1998, vol. 3, of The Art of Computer Programming.
15. T. C. Bell and I. H. Witter., "The relationship between greedy parsing and symboiwise text compression," J. ACM, vol. 41. pp. 708-724, July 1994.
16. G. G. Langdon, "A note on the Ziv-Lempel model for compressing individual sequences." IEEE Trans. Inform. Theory, vol. IT-29, pp. 284-287, Mar. 1983.
17. P. C. Gutmann and T. C. Bell, "A hybrid approach to text compression," in Proc. IEEE Data Compression Conf., Mar. 1994, pp. 225-233.
18. I. H. Witten, A. Moffat. and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd ad. San Mateo, CA: Morgan Kaufmann, 1999.
19. A. Moffat and L. Stuiver, "Binary interpolative coding for effective index compression," Inform. Retrieval, vol. 3. pp. 25-47. July 2000.
20. A. Moffat and A. Turpin, "On the implementation of minimum-redundancy prefix codes," IEEE Trans. Coinmuti., vol. 45, pp. 1200-1207, Oct. 1997.
21. A. Turpin and A. Moffat, "Housekeeping for prefix coding," IEEE Trans. Commun., vol. 48, pp. 622-648, Apr. 2000.
22. J. I. Gailly, "Gzip program and documentation,", Source code available from ftp://prep.ai.mit.edu/pub/gnu/gzip-*.tar, 1993.
23. A. Moffat, "implementing the PPM data compression scheme," IEEE Tram. Commun., vol. 38. pp. 1917-1921, Nov. 1990.
24. P. G. Howard, "The design and analysis of efficient lossless data compression systems," Ph.D. dissertation, Dept. Comput. Sci., Brown Univ., Providence. RI, June 1993.
25. N. Jesper Larsson received the Ph.D. degree from Lund University, Lund, Sweden, in 1999. His doctoral dissertation. "Structures of String Matching and Data Compression," describes efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. He is currently with Apptus Technologies, Lund, a company that specializes in the efficient management of massive amounts of data. Alistair Moffat received the Ph.D. degree from the University of Canterbury, New Zealand, in 1986. Since then, he has beer, a Member of Academic Staff at the University of Melbourne, Australia, and is currently an Associate Professor. His research interests include text and image compression, techniques for indexing and accessing large text databases, and algorithms for sorting and searching. He is a coauthor of the book Manusinv Gieubwes: Compressing and Indexing Documents and images, (San Mateo, CA: Morgan Kaufmann, 1999, 2nd ed.) and has written more than 90 refereed papers. Dr. Moffat is a member of the ACM and the IEEE Computer Society.