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 |
|---|---|
| Pages (from-to) | 340-347 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | SE-6 |
| Issue number | 4 |
| State | Published - Jul 1 1980 |
Fingerprint
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Software
- Electrical and Electronic Engineering
Cite this
OVERHEAD STORAGE CONSIDERATIONS AND A MULTILINEAR METHOD FOR DATA FILE COMPRESSION. / Young, Tzay Y.; Liu, Philip S.
In: IEEE Transactions on Software Engineering, Vol. SE-6, No. 4, 01.07.1980, p. 340-347.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - OVERHEAD STORAGE CONSIDERATIONS AND A MULTILINEAR METHOD FOR DATA FILE COMPRESSION.
AU - Young, Tzay Y.
AU - Liu, Philip S.
PY - 1980/7/1
Y1 - 1980/7/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0019035468&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0019035468&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0019035468
VL - SE-6
SP - 340
EP - 347
JO - IEEE Transactions on Software Engineering
JF - IEEE Transactions on Software Engineering
SN - 0098-5589
IS - 4
ER -