Title :
LZRW1 without hashing
Author :
Reznik, Yuriy A.
fDate :
30 Mar-1 Apr 1998
Abstract :
Summary form only given. A very fast longest-match string search algorithm for Ziv-Lempel compression has been proposed. The new algorithm uses a variable-radix search tree of limited maximum size with an appropriate node-replacement strategy. The efficiency of the new algorithm has been practically evaluated using the LZRW1 implementation as a test model. The results of the evaluation are presented in a table
Keywords :
data compression; string matching; tree searching; LZRW1 implementation; Ziv-Lempel compression; efficiency; fast longest-match string search algorithm; limited maximum size; node-replacement strategy; test model; variable-radix search tree; Data compression; Search engines; Testing;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672311
