Database compression
Authors:
- Mark A. RothMRMark A. Roth
- Scott J. Van HornSHScott J. Van Horn
Open Access
- 1 September 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 22 (3) , 31-39
Abstract
Despite the fact that computer memory costs have decreased dramatically over the past few years, data storage still remains, and will probably always remain, an important cost factor for many large scale database applications. Compressing data in a database system is attractive for two reasons: data storage reduction and performance improvement. Storage reduction is a direct and obvious benefit, while performance improves because smaller amounts of physical data need to be moved for any particular operation on the database.We address several aspects of reversible data compression and compression techniques: general concepts of data compression; a number of compression techniques; a comparison of the effects of compression on common data types; advantages and disadvantages of compressing data; and future research needs.Keywords
This publication has 7 references indexed in Scilit:
- Application of splay trees to data compressionCommunications of the ACM, 1988
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Data Compression in Scientific and Statistical DatabasesIEEE Transactions on Software Engineering, 1985
- A Technique for High-Performance Data CompressionComputer, 1984
- A practitioner's guide to data base compression tutorialInformation Systems, 1983
- Special Feature An Overview of Data Compression TechniquesComputer, 1981
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952