Abstract
Consideration is given to the reduction of overhead storage, i. e. , the stored compression/decompression (C/D) table, in field-level data file compression. A large C/D table can occupy a large fraction of main memory space during compression and decompression, and may cause excessive page swapping in virtual memory systems. A multilinear compression method is proposed which is capable of reducing the overhead storage by a significant factor. Multilinear compression groups data items into several clusters and then compresses each cluster by a binary-field linear transformation. Algorithms for clustering and transformation are developed, and data compression examples are presented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 340-347 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | SE-6 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 1980 |
ASJC Scopus subject areas
- Software
Fingerprint Dive into the research topics of 'Overhead Storage Considerations and a Multilinear Method for Data File Compression'. Together they form a unique fingerprint.
Cite this
Young, T. Y., & Liu, P. S. (1980). Overhead Storage Considerations and a Multilinear Method for Data File Compression. IEEE Transactions on Software Engineering, SE-6(4), 340-347. https://doi.org/10.1109/TSE.1980.234490