The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Data compression using static Huffman code-decode tables
Communications of the ACM
ACM Computing Surveys (CSUR)
Combining the concepts of compression and caching for a two-level filesystem
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Communications of the ACM
Storing text using integer codes
COLING '86 Proceedings of the 11th coference on Computational linguistics
Utilization of character reference locality for efficient storage of data base
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
| Hi-index | 48.25 |
The performance of most small computer systems is determined, to a large extent, by the characteristics of their mass storage devices. Data compression can expand the storage capacity of such devices and also slightly increase their speed. Here, a summary of one method of data compression using Huffman variable length coding is presented, along with statistics of effectiveness for various file types and practical techniques for integrating such methods into a small computer system.