Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting

スポンサーリンク

概要

• 論文の詳細を見る

• Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.

• 一般社団法人電子情報通信学会の論文
• 2000-12-25

著者

• Sadakane K

  Tohoku Univ. Sendai‐shi Jpn

• Imai Hiroshi

  The Department Of Information Science The University Of Tokyo

• SADAKANE Kunihiko

  the Department of Information Science, The University of Tokyo

関連論文

• Divergence-Based Geometric Clustering and Its Underlying Discrete Proximity Structures (Special Issue on Surveys on Discovery Science)
• Fast Algorithms for k-Word Proximity Search
• Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting

スポンサーリンク