Word-Based Compression Methods and Indexing for Text Retrieval Systems

What is it about?

In this article we present a new compression method, called WLZW, which is a word-based modication of classic LZW. The modication is similar to the approach used in the HuffWord compression algorithm. The algorithm is two-phase, the compression ratio achieved is fairly good, on average 22%-20% (see [2],[3]). Moreover, the table of words, which is side product of compression, can be used to create full-text index, especially for dynamic text databases. Overhead of the index is good.

Featured Image