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
Y1 - 1980/7
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
U2 - 10.1109/TSE.1980.234490
DO - 10.1109/TSE.1980.234490
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 -