Fixed length semiorder preserving code for field level data file compression

Motomichi Toyama; Shoji Ura

doi:10.1109/ICDE.1984.7271278

Fixed length semiorder preserving code for field level data file compression

Motomichi Toyama, Shoji Ura

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.

Original language	English
Title of host publication	Proceedings - International Conference on Data Engineering
Publisher	IEEE Computer Society
Pages	244-252
Number of pages	9
Volume	2015-September
ISBN (Print)	0818605332, 081860655X, 9780818605338, 9780818606557
DOIs	https://doi.org/10.1109/ICDE.1984.7271278
Publication status	Published - 2015 Sept 14
Event	1st IEEE International Conference on Data Engineering, COMPDEC 1984 - Los Angeles, United States Duration: 1984 Apr 24 → 1984 Apr 27

Other

Other	1st IEEE International Conference on Data Engineering, COMPDEC 1984
Country/Territory	United States
City	Los Angeles
Period	84/4/24 → 84/4/27

Keywords

Bismuth
Data compression
Decoding
Encoding
Indexes
Libraries
Radiation detectors

ASJC Scopus subject areas

Information Systems
Signal Processing
Software

Access to Document

10.1109/ICDE.1984.7271278

Cite this

Toyama, M & Ura, S 2015, Fixed length semiorder preserving code for field level data file compression. in Proceedings - International Conference on Data Engineering. vol. 2015-September, 7271278, IEEE Computer Society, pp. 244-252, 1st IEEE International Conference on Data Engineering, COMPDEC 1984, Los Angeles, United States, 84/4/24. https://doi.org/10.1109/ICDE.1984.7271278

@inproceedings{3f948a863eee4db4ae562eb778e867df,

title = "Fixed length semiorder preserving code for field level data file compression",

abstract = "An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.",

keywords = "Bismuth, Data compression, Decoding, Encoding, Indexes, Libraries, Radiation detectors",

author = "Motomichi Toyama and Shoji Ura",

year = "2015",

month = sep,

day = "14",

doi = "10.1109/ICDE.1984.7271278",

language = "English",

isbn = "0818605332",

volume = "2015-September",

pages = "244--252",

booktitle = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE Computer Society",

note = "1st IEEE International Conference on Data Engineering, COMPDEC 1984 ; Conference date: 24-04-1984 Through 27-04-1984",

}

TY - GEN

T1 - Fixed length semiorder preserving code for field level data file compression

AU - Toyama, Motomichi

AU - Ura, Shoji

PY - 2015/9/14

Y1 - 2015/9/14

N2 - An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.

AB - An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.

KW - Bismuth

KW - Data compression

KW - Decoding

KW - Encoding

KW - Indexes

KW - Libraries

KW - Radiation detectors

UR - http://www.scopus.com/inward/record.url?scp=84958694428&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958694428&partnerID=8YFLogxK

U2 - 10.1109/ICDE.1984.7271278

DO - 10.1109/ICDE.1984.7271278

M3 - Conference contribution

AN - SCOPUS:84958694428

SN - 0818605332

SN - 081860655X

SN - 9780818605338

SN - 9780818606557

VL - 2015-September

SP - 244

EP - 252

BT - Proceedings - International Conference on Data Engineering

PB - IEEE Computer Society

T2 - 1st IEEE International Conference on Data Engineering, COMPDEC 1984

Y2 - 24 April 1984 through 27 April 1984

ER -

Fixed length semiorder preserving code for field level data file compression

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this