Models of bitmap generation: A systematic approach to bitmap compression

Abraham Bookstein, Shmuel T. Klein

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


In large IR systems, information about word occurrence may be stored in the form of 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. The methods also use a new way of enumerating subsets of fixed size from a given superset. Preliminary experimental results indicate improvements over previous methods.

Original languageEnglish
Pages (from-to)735-748
Number of pages14
JournalInformation Processing and Management
Issue number6
StatePublished - 1992


Dive into the research topics of 'Models of bitmap generation: A systematic approach to bitmap compression'. Together they form a unique fingerprint.

Cite this