Revisiting dictionary-based compression: Research Articles
Software—Practice & Experience
Migrating an MVS mainframe application to a PC
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Compressing table data with column dependency
Theoretical Computer Science
RadixZip: linear time compression of token streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A compression-boosting transform for two-dimensional data
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.02 |
Large amounts of business data are kept in tables of fixed-length records. Columns in such a table may be functionally dependent on one another, resulting in low overall information content. This paper shows how to exploit this source of information redundancy to compress table data. Experiments with a wide variety of massive tables including telecom data and stock quotes show that this technique compresses table data well, up to 48:1 or even 100:1 reduction in some cases.