Flexible compression for bitmap sets

A. Bookstein; S. T. Klein

doi:10.1109/dcc.1991.213340

Flexible compression for bitmap sets

A. Bookstein, S. T. Klein

The University of Chicago

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

6 Scopus citations

Abstract

Bitmaps are useful for information retrieval [2] as as well as other computer applications, but can be expensive to store. In many situations, the bitmaps are very sparse, that is, the number of 1-bits is substantially smaller than the number of zeros, so that compression techniques can be very helpful. But, more than is the case with text compression, bitmap compression tends to be based on ad hoc ideas rather than on proveably optimal algorithms motivated by models of bit generation (see however [5]). For an overview of several bit-vector compression techniques the reader is referred to [3].

Original language	English
Title of host publication	Data Compression Conference 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	402-410
Number of pages	9
ISBN (Electronic)	0818692022
DOIs	https://doi.org/10.1109/dcc.1991.213340
State	Published - 1991
Externally published	Yes
Event	1991 Data Compression Conference, DCC 1991 - Snowbird, United States Duration: 8 Apr 1991 → 11 Apr 1991

Publication series

Name	Data Compression Conference Proceedings
Volume	1991-April
ISSN (Print)	1068-0314

Conference

Conference	1991 Data Compression Conference, DCC 1991
Country/Territory	United States
City	Snowbird
Period	8/04/91 → 11/04/91

Bibliographical note

Publisher Copyright:
© 1991 IEEE.

Access to Document

10.1109/dcc.1991.213340

Cite this

@inproceedings{d7740caef4284798b271869778363071,

title = "Flexible compression for bitmap sets",

abstract = "Bitmaps are useful for information retrieval [2] as as well as other computer applications, but can be expensive to store. In many situations, the bitmaps are very sparse, that is, the number of 1-bits is substantially smaller than the number of zeros, so that compression techniques can be very helpful. But, more than is the case with text compression, bitmap compression tends to be based on ad hoc ideas rather than on proveably optimal algorithms motivated by models of bit generation (see however [5]). For an overview of several bit-vector compression techniques the reader is referred to [3].",

author = "A. Bookstein and Klein, {S. T.}",

note = "Publisher Copyright: {\textcopyright} 1991 IEEE.; 1991 Data Compression Conference, DCC 1991 ; Conference date: 08-04-1991 Through 11-04-1991",

year = "1991",

doi = "10.1109/dcc.1991.213340",

language = "אנגלית",

series = "Data Compression Conference Proceedings",

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

pages = "402--410",

booktitle = "Data Compression Conference 1991",

address = "ארצות הברית",

}

TY - GEN

T1 - Flexible compression for bitmap sets

AU - Bookstein, A.

AU - Klein, S. T.

PY - 1991

Y1 - 1991

N2 - Bitmaps are useful for information retrieval [2] as as well as other computer applications, but can be expensive to store. In many situations, the bitmaps are very sparse, that is, the number of 1-bits is substantially smaller than the number of zeros, so that compression techniques can be very helpful. But, more than is the case with text compression, bitmap compression tends to be based on ad hoc ideas rather than on proveably optimal algorithms motivated by models of bit generation (see however [5]). For an overview of several bit-vector compression techniques the reader is referred to [3].

AB - Bitmaps are useful for information retrieval [2] as as well as other computer applications, but can be expensive to store. In many situations, the bitmaps are very sparse, that is, the number of 1-bits is substantially smaller than the number of zeros, so that compression techniques can be very helpful. But, more than is the case with text compression, bitmap compression tends to be based on ad hoc ideas rather than on proveably optimal algorithms motivated by models of bit generation (see however [5]). For an overview of several bit-vector compression techniques the reader is referred to [3].

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

U2 - 10.1109/dcc.1991.213340

DO - 10.1109/dcc.1991.213340

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85027190279

T3 - Data Compression Conference Proceedings

SP - 402

EP - 410

BT - Data Compression Conference 1991

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1991 Data Compression Conference, DCC 1991

Y2 - 8 April 1991 through 11 April 1991

ER -

Flexible compression for bitmap sets

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this