Data compression on a database system
- 1 December 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (12), 1336-1342
- https://doi.org/10.1145/214956.214963
Abstract
A general-purpose data-compression routine—implemented on the IMS database system—makes use of context to achieve better compression than Huffman's method applied character by character. It demonstrates that a wide variety of data can be compressed effectively using a single, fixed compression routine with almost no working storage.Keywords
This publication has 3 references indexed in Scilit:
- Algorithms for adaptive Huffman codesInformation Processing Letters, 1984
- Special Feature An Overview of Data Compression TechniquesComputer, 1981
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977