Data compression with finite windows

Authors:
E. R. Fiala;D. H. Greene
Affiliations:
Xerox PARC, Palo Alto, CA;Xerox PARC, Palo Alto, CA
Venue:
Communications of the ACM
Year:
1989

Citing 14
Cited 39

Dynamic Huffman coding

Journal of Algorithms
Compression of character strings by an adaptive dictionary

BIT
A locally adaptive data compression scheme

Communications of the ACM
Data compression using dynamic Markov modelling

The Computer Journal
Text compression

Text compression
Arithmetic coding for data compression

Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
Data compression via textual substitution

Journal of the ACM (JACM)
Economical encoding of commas between strings

Communications of the ACM
Using string matching to compress Chinese characters

Using string matching to compress Chinese characters
Source coding algorithms for fast data compression.

Source coding algorithms for fast data compression.

Systolic implementations of a move-to-front text compressor

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Modeling for text compression

ACM Computing Surveys (CSUR)
Online algorithms for locating checkpoints

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An honors course in data compression

SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Systolic implementations of a move-to-front text compressor

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Practical dictionary management for hardware data compression

Communications of the ACM
On-line algorithms for cache sharing

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The relationship between greedy parsing and symbolwise text compression

Journal of the ACM (JACM)
Efficient recompression techniques for dynamic full-text retrieval systems

SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Estimating alphanumeric selectivity in the presence of wildcards

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Modeling word occurrences for the compression of concordances

ACM Transactions on Information Systems (TOIS)
A multiple processor approach to data compression

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
A Hardware Architecture for the LZW Compression and Decompression Algorithms Based on Parallel Dictionaries

Journal of VLSI Signal Processing Systems
Simple Bayesian Model for Bitmap Compression

Information Retrieval
The V.42bis Standard for Data-Compressing Modems

IEEE Micro
Compact Directed Acyclic Word Graphs for a Sliding Window

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
SAMC - efficient semi-adaptive data compression

CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
Multiple-dictionary compression using partial matching

DCC '95 Proceedings of the Conference on Data Compression
Unbounded length contexts for PPM

DCC '95 Proceedings of the Conference on Data Compression
Start/Stop Codes

DCC '01 Proceedings of the Data Compression Conference
Truncated suffix trees and their application to data compression

Theoretical Computer Science
Compact directed acyclic word graphs for a sliding window

Journal of Discrete Algorithms - SPIRE 2002
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles

Software—Practice & Experience
Online prefix-free encoding algorithm

SPPRA'06 Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applications
VTAssist: a location-based feedback notification system for the disabled

Proceedings of the 44th annual Southeast regional conference
Grayscale true two-dimensional dictionary-based image compression

Journal of Visual Communication and Image Representation
Preprocessing in a tiered sensor network for habitat monitoring

EURASIP Journal on Applied Signal Processing
Sliding CDAWG Perfection

SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the bit-complexity of Lempel-Ziv compression

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reducing the space complexity of a Bayes coding algorithm using an expanded context tree

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Estimating the number of substring matches in long string databases

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Suffix tree based data compression

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Grayscale two-dimensional lempel-ziv encoding

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
On-line suffix tree construction with reduced branching

Journal of Discrete Algorithms
On compressing and indexing repetitive sequences

Theoretical Computer Science
On parsing optimality for dictionary-based text compression-the Zip case

Journal of Discrete Algorithms
Durable data storage in distributed non persistent caching environment

Proceedings of the 6th ACM India Computing Convention
Migratory compression: coarse-grained data reordering to improve compressibility

FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies

Quantified Score

Hi-index	48.24

Visualization

Abstract

Several methods are presented for adaptive, invertible data compression in the style of Lempel's and Ziv's first textual substitution proposal. For the first two methods, the article describes modifications of McCreight's suffix tree data structure that support cyclic maintenance of a window on the most recent source characters. A percolating update is used to keep node positions within the window, and the updating process is shown to have constant amortized cost. Other methods explore the tradeoffs between compression time, expansion time, data structure size, and amount of compression achieved. The article includes a graph-theoretic analysis of the compression penalty incurred by our codeword selection policy in comparison with an optimal policy, and it includes empirical studies of the performance of various adaptive compressors from the literature.