Algorithms for adaptive Huffman codes
Information Processing Letters
Data compression using static Huffman code-decode tables
Communications of the ACM
Journal of Algorithms
ACM Computing Surveys (CSUR)
A locally adaptive data compression scheme
Communications of the ACM
Bounds on the redundancy of Huffman codes
IEEE Transactions on Information Theory
Digital image processing (2nd ed.)
Digital image processing (2nd ed.)
Data compression for a source with Markov characteristics
The Computer Journal
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
Data structure of Huffman codes and its application to efficient encoding and decoding
IEEE Transactions on Information Theory
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Arithmetic coding for data compression
Communications of the ACM
Data compression on a database system
Communications of the ACM
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters
Journal of the ACM (JACM)
Fast Algorithms for Manipulating Formal Power Series
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)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
File archival techniques using data compression
Communications of the ACM
Experiments in text file compression
Communications of the ACM
A new technique for compression and storage of data
Communications of the ACM
Common phrases and minimum-space text storage
Communications of the ACM
Generating a canonical prefix encoding
Communications of the ACM
Data Compression and Error Control Techniques with Applications
Data Compression and Error Control Techniques with Applications
Data Structure Techniques
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Source coding algorithms for fast data compression.
Source coding algorithms for fast data compression.
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Systolic implementations of a move-to-front text compressor
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
ACM Computing Surveys (CSUR)
Efficient decoding of prefix codes
Communications of the ACM
Compression, information theory, and grammars: a unified approach
ACM Transactions on Information Systems (TOIS)
Construction of optimal graphs for bit-vector compression
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
An honors course in data compression
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
GT-EP: a novel high-performance real-time architecture
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Systolic implementations of a move-to-front text compressor
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
A hybrid bilevel image decode algorithm for group 4 FAX
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
Practical dictionary management for hardware data compression
Communications of the ACM
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
ACM SIGACT News
Is Huffman coding dead? (extended abstract)
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
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
Potential benefits of delta encoding and data compression for HTTP
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient indexing for broadcast based wireless systems
Mobile Networks and Applications - Special issue on mobile computing and system services
A hypermedia version control framework
ACM Transactions on Information Systems (TOIS)
The bits between the lambdas: binary data in a lazy functional language
Proceedings of the 1st international symposium on Memory management
Knowledge management and XML: derivation of synthetic views over semi-structured data
ACM SIGAPP Applied Computing Review
A general-purpose compression scheme for large collections
ACM Transactions on Information Systems (TOIS)
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts
Information Retrieval
CAS-BUS: A Test Access Mechanism and a Toolbox Environment for Core-Based System Chip Testing
Journal of Electronic Testing: Theory and Applications
Diagnostic Data Compression Techniques for Embedded Memories with Built-In Self-Test
Journal of Electronic Testing: Theory and Applications
Context-sensitive mobile database summarisation
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Adaptive Online Data Compression
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Scrap more boilerplate: reflection, zips, and generalised casts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Network transportation and optimization for grid-enabled visualization techniques
Neural, Parallel & Scientific Computations - Special issue: Grid computing
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Energy-aware lossless data compression
ACM Transactions on Computer Systems (TOCS)
Grid-based computer animation rendering
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Improving duplicate elimination in storage systems
ACM Transactions on Storage (TOS)
Redundancy elimination within large collections of files
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Compression proxy server: design and implementation
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
A simpler analysis of Burrows–Wheeler-based compression
Theoretical Computer Science
An adaptive character wordlength algorithm for data compression
Computers & Mathematics with Applications
Low-constant parallel algorithms for finite element simulations using linear octrees
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
A novel lossless data compression scheme based on the error correcting Hamming codes
Computers & Mathematics with Applications
Supporting co-evolution of users and systems by the recognition of interaction patterns
Proceedings of the Working Conference on Advanced Visual Interfaces
Efficient locally trackable deduplication in replicated systems
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Efficient index compression in DB2 LUW
Proceedings of the VLDB Endowment
Enhancing secrecy by data compression: theoretical and practical aspects
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Using transparent compression to improve SSD-based I/O caches
Proceedings of the 5th European conference on Computer systems
Optimizing evolution rules application and communication times in membrane systems implementation
WMC'07 Proceedings of the 8th international conference on Membrane computing
Efficient locally trackable deduplication in replicated systems
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Discrete sequence prediction and its applications
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
BEMC: a searchable, compressed representation for large seismic wavefields
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Using causal information and local measures to learn Bayesian networks
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
A preprocessor adding security to and improving the performances of arithmetic and huffman codings
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
A simpler analysis of burrows-wheeler based compression
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Molecular Dynamics Trajectory Compression with a Coarse-Grained Model
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient compression of text attributes of data warehouse dimensions
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Transparent Online Storage Compression at the Block-Level
ACM Transactions on Storage (TOS)
Characteristics of backup workloads in production systems
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
An adaptive algorithm for online time series segmentation with error bound guarantee
Proceedings of the 15th International Conference on Extending Database Technology
Non-linear compression: Gzip Me Not!
HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
Durable data storage in distributed non persistent caching environment
Proceedings of the 6th ACM India Computing Convention
Hi-index | 0.03 |
This paper surveys a variety of data compression methods spanning almost 40 years of research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986. The aim of data compression is to reduce redundancy in stored or communicated data, thus increasing effective data density. Data compression has important application in the areas of file storage and distributed systems. Concepts from information theory as they relate to the goals and evaluation of data compression methods are discussed briefly. A framework for evaluation and comparison of methods is constructed and applied to the algorithms presented. Comparisons of both theoretical and empirical natures are reported, and possibilities for future research are suggested.