Generative models for bitmap sets with compression applications

Abraham Bookstein; Shmuel T. Klein

doi:10.1145/122860.122867

Generative models for bitmap sets with compression applications

Abraham Bookstein, Shmuel T. Klein

The University of Chicago

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

3 Scopus citations

Abstract

In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the 1-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.

Original language	English
Title of host publication	Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991
Publisher	Association for Computing Machinery, Inc
Pages	63-71
Number of pages	9
ISBN (Print)	0897914481, 9780897914482
DOIs	https://doi.org/10.1145/122860.122867
State	Published - 1 Sep 1991
Event	14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991 - Chicago, United States Duration: 13 Oct 1991 → 16 Oct 1991

Publication series

Name	Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991

Conference

Conference	14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991
Country/Territory	United States
City	Chicago
Period	13/10/91 → 16/10/91

Bibliographical note

Publisher Copyright:
© 1991 ACM. All rights reserved.

Access to Document

10.1145/122860.122867

Cite this

Bookstein, A., & Klein, S. T. (1991). Generative models for bitmap sets with compression applications. In Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991 (pp. 63-71). (Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991). Association for Computing Machinery, Inc. https://doi.org/10.1145/122860.122867

Bookstein, Abraham ; Klein, Shmuel T. / Generative models for bitmap sets with compression applications. Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991. Association for Computing Machinery, Inc, 1991. pp. 63-71 (Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991).

@inproceedings{3982bb5dc37943a59089fc58b5a0792d,

title = "Generative models for bitmap sets with compression applications",

abstract = "In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the 1-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.",

author = "Abraham Bookstein and Klein, {Shmuel T.}",

note = "Publisher Copyright: {\textcopyright} 1991 ACM. All rights reserved.; 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991 ; Conference date: 13-10-1991 Through 16-10-1991",

year = "1991",

month = sep,

day = "1",

doi = "10.1145/122860.122867",

language = "אנגלית",

isbn = "0897914481",

series = "Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991",

publisher = "Association for Computing Machinery, Inc",

pages = "63--71",

booktitle = "Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991",

}

Bookstein, A & Klein, ST 1991, Generative models for bitmap sets with compression applications. in Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991. Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991, Association for Computing Machinery, Inc, pp. 63-71, 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991, Chicago, United States, 13/10/91. https://doi.org/10.1145/122860.122867

Generative models for bitmap sets with compression applications. / Bookstein, Abraham; Klein, Shmuel T.
Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991. Association for Computing Machinery, Inc, 1991. p. 63-71 (Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991).

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

TY - GEN

T1 - Generative models for bitmap sets with compression applications

AU - Bookstein, Abraham

AU - Klein, Shmuel T.

PY - 1991/9/1

Y1 - 1991/9/1

N2 - In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the 1-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.

AB - In large IR systems, information about word occurrence may be stored as a bit matrix, with rows corresponding to different words and columns to documents. Such a matrix is generally very large and very sparse. New methods for compressing such matrices are presented, which exploit possible correlations between rows and between columns. The methods are based on partitioning the matrix into small blocks and predicting the 1-bit distribution within a block by means of various bit generation models. Each block is then encoded using Huffman or arithmetic coding. Preliminary experimental results indicate improvements over previous methods.

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

U2 - 10.1145/122860.122867

DO - 10.1145/122860.122867

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

AN - SCOPUS:33747681688

SN - 0897914481

SN - 9780897914482

T3 - Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991

SP - 63

EP - 71

BT - Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991

PB - Association for Computing Machinery, Inc

T2 - 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991

Y2 - 13 October 1991 through 16 October 1991

ER -

Bookstein A, Klein ST. Generative models for bitmap sets with compression applications. In Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991. Association for Computing Machinery, Inc. 1991. p. 63-71. (Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1991). doi: 10.1145/122860.122867

Generative models for bitmap sets with compression applications

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this