Improving the speed of LZ77 compression by hashing and suffix sorting

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 12, 2000, Pages 2689-2698

  Sadakane, Kunihiko ^a   Imai, Hiroshi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK SORTING; HASHING;

DATA REDUCTION; SORTING;

DATA COMPRESSION;

EID: 0034510822     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. R. Arnold and T. Bell, "A corpus for the evaluation of lossless compression algorithms," Proc. IEEE Data Compression Conference, pp.201-210, March 1997. http://corpus.canterbury.ac.nz/
2. B. Balkcnhol, S. Kurtz, and Y.M. Shtarkov. "Modification of the Burrows and Wheeler data compression algorithm," Proc. IEEE Data Compression Conference, pp.188197, March 1999.
3. T. Bell, J.G. Clcary, and I.H. Wittcn, Text Compression, Prentice Hall, 1990, ftp://ftp.cpsc.ucalgeiry.ca /pub/projects/text.compression.corpus/
4. T. Bell and D. Kulp, "Longest-match string searching for Ziv-Leinpel compression," Software-Practice and Experience, vol.23, no.7, pp.757-771, July 1993.
5. M. Burrows and D.J. Wheeler, "A block-sorting lossless data compression algorithms," Technical Report 124, Digital SRC Research Report, 1991.
6. Jean-loup Gailly, gzip, 1993.f tp://ftp.gnu.org/gnu/gzip/gzip-1.2.4.t ar.gz
7. R.N. Horspool, "The effect of non-greedy parsing in ZivLempel compression methods," Proc. IEEE Data Compression Conference, pp.302-311, 1995.
8. Imai laboratory homepage. http://wu-imai.is.s.u-tokyo.ac.jp/
9. D.E. Knuth, The Art of Computer Programming, vol.3Sorting and Searching, Addison-Wesley, Reading MA, 1973.
10. N.J. Larsson, ''Extended application of suffix trees to data compression," Proc. IEEE Data Compression Conference, pp.190-199, April 1996.
11. N.J. Larsson and K. Sadakane, "Faster suffix sorting," Technical Report LU-CS-TR:99-214, LUNDFD6/(NFCS3140)/1-20/(1999), Department of Computer Science, Lund University, Sweden, May 1999. http://Hww.cs.lth.se /home/Jesper-Larsson/
12. U. Manbcr and G. Myers, "Suffix arrays: A new method for on-line string searches," SIAM J. Comput., vol.22, no.5, pp.935-948, Oct. 1993.
13. P.K. Pearson, "Fast hashing of variable-length text strings," Communications of the Association for Computing Machinery, vol.33, no.G, pp.G77-C80, June 1990.
14. J. Seward,bzip2,199G.http://www.muraroa.demon.co.uk/
15. A.D. Wyner and J. Ziv, ''The sliding-window Lempel-Ziv algorithm is asymptotically optimal," Proc. IEEE, vol.82, no.G, pp.872-877, June 1994.
16. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inf. Theory, vol.IT-23, no.3, pp.337-343, May 1977.