Overhead Storage Considerations and a Multilinear Method for Data File Compression

Tzay Y. Young; Philip S. Liu

doi:10.1109/TSE.1980.234490

Overhead Storage Considerations and a Multilinear Method for Data File Compression

Tzay Y. Young, Philip S. Liu

Electrical & Computer Engineering

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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	https://doi.org/10.1109/TSE.1980.234490
State	Published - Jul 1980

ASJC Scopus subject areas

Software

Access to Document

10.1109/TSE.1980.234490

Cite this

@article{e79cf9253e23426c9348ac29f387124d,

title = "Overhead Storage Considerations and a Multilinear Method for Data File Compression",

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.",

author = "Young, {Tzay Y.} and Liu, {Philip S.}",

year = "1980",

month = jul,

doi = "10.1109/TSE.1980.234490",

language = "English (US)",

volume = "SE-6",

pages = "340--347",

journal = "IEEE Transactions on Software Engineering",

issn = "0098-5589",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

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 -

Overhead Storage Considerations and a Multilinear Method for Data File Compression

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this