Abstract:
An efficient variant of an optimal algorithm is presented, which reorganizes data that has been compressed by some on-the-fly compression method, into a more compact form, without changing the decoding procedure. The algorithm accelerates and improves the space requirements of a known technique based on a reduction to a graph-theoretic problem, by reducing the size of the graph, without affecting the efficiency of the solution that is optimal for the given encoding method. The new method can effectively improve any static dictionary compression scheme using a static encoding method, and in particular some LZ77 variants.
Citations
|
6327
|
Introduction to algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
809
|
A universal algorithm for sequential data compression
– Ziv, Lempel
- 1977
|
|
728
|
A note on two problems in connexion with graphs
– Dijkstra
- 1959
|
|
620
|
A Method for the Construction of Minimum Redundancy Codes
– Huffman
- 1952
|
|
576
|
Text Compression
– Bell, Cleary, et al.
- 1990
|
|
549
|
Arithmetic coding for data compression
– Witten, Neal, et al.
- 1987
|
|
518
|
Compression of individual sequences via variable-rate coding
– Ziv, Lempel
- 1978
|
|
317
|
Graph Algorithms
– Even
- 1979
|
|
150
|
Data Compression: Methods and Theory
– Storer
- 1988
|
|
83
|
Data compression via textual substitution
– Storer, Szymanski
- 1982
|
|
72
|
Data compression in full-text retrieval systems
– Zobel, Moffat
- 1993
|
|
60
|
Data compression with finite windows
– Fiala, Greene
- 1989
|
|
29
|
An extremely fast Ziv-Lempel data compression algorithm
– Williams
- 1991
|
|
19
|
The effect of non-greedy parsing in Ziv-Lempel compression methods
– Horspool
- 1995
|
|
17
|
Leiserson C.E., and Rivest R.L., Introduction to algorithms
– Cormen
- 1990
|
|
16
|
Common Phrases and Minimum-Space Text Storage
– Wagner
- 1973
|
|
11
|
Better OPM/L text compression
– Bell
- 1986
|
|
10
|
A linear algorithm for data compression
– Brent
- 1987
|
|
9
|
Storing Text Retrieval Systems on CD-ROM
– Klein, Bookstein, et al.
- 1989
|
|
8
|
Parsing algorithms for dictionary compression
– Hirschberg, Stauffer
- 1994
|
|
7
|
A comparison of algorithms for data base compression by use of fragments as language elements
– Schuegraf, Heaps
- 1974
|
|
6
|
An analysis of the longest match and the greedy heuristics in text encoding
– Katajainen, Raita
- 1992
|
|
3
|
An approximation algorithm for space-optimal encoding of a text
– Katajainen, Raita
- 1989
|
|
