OVERHEAD STORAGE CONSIDERATIONS AND A MULTILINEAR METHOD FOR DATA FILE COMPRESSION.

Tzay Y. Young, Philip S. Liu

Research output: Contribution to journalArticle

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)340-347
Number of pages8
JournalIEEE Transactions on Software Engineering
VolumeSE-6
Issue number4
StatePublished - Jul 1 1980

Fingerprint

Data storage equipment
Linear transformations
Data compression

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 journalArticle

@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 = "7",
day = "1",
language = "English",
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/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 -