(Enter summary)
Abstract: : In large IR systems, information about word occurrence may be stored in 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... (Update)
Context of citations to this paper: More
...0, we get A a =A h 1. The use of incorrect probabilities is not very unusual. In an application to modelbased bitmap compression [5], Huffman codes gave consistently better compression than arithmetic codes. This was explained by the fact that the model predicted many...
Cited by: More
Searchable Compressed Representations of Very Sparse Bitmaps.. - Pigeon, Wu (2003)
(Correct)
Is Huffman Coding Dead? - Bookstein, Klein (1993)
(Correct)
Active bibliography (related documents): More All
1.3: Parameterised Compression for Sparse Bitmaps - Moffat, Zobel (1992)
(Correct)
1.0: Compression of Correlated Bit-Vectors - Bookstein, Klein (1990)
(Correct)
0.4: Storing Text Retrieval Systems on CD-ROM: Compression.. - Klein, Bookstein.. (1989)
(Correct)
Similar documents based on text: More All
0.2: Simple Bayesian Model for Bitmap Compression - Bookstein, Klein, Raita (2000)
(Correct)
0.2: An Overhead Reduction Technique for Mega-State Compression.. - Bookstein, Klein, Raita (1997)
(Correct)
0.1: Pbmfilters - Poskanzer (1991)
(Correct)
Related documents from co-citation: More All
2: Universal codeword sets and the representation of the integers (context) - Elias - 1975
BibTeX entry: (Update)
Bookstein A., Klein S.T., Models of Bitmap Generation: A Systematic Approach to Bitmap Compression, Information Processing & Management 28 (1992) 735--748. http://citeseer.ist.psu.edu/bookstein92models.html More
@article{ bookstein92models,
author = "Abraham Bookstein and Shmuel T. Klein",
title = "Models of Bitmap Generation: A Systematic Approach to Bitmap Compression",
journal = "Information Processing and Management",
volume = "28",
number = "6",
pages = "735-748",
year = "1992",
url = "citeseer.ist.psu.edu/bookstein92models.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1973
1749
An Introduction to Probability Theory and its Applications (context) - Feller - 1950
344
Arithmetic coding for data compression (context) - Witten, Neal et al. - 1987
137
Universal codeword sets and representations of integers (context) - Elias - 1975
95
Coding and Information Theory (context) - Hamming - 1980
92
Combinatorial Algorithms: Theory and Practice (context) - Reingold, Nievergelt et al. - 1977
80
An Introduction to Combinatorial Analysis (context) - Riordan - 1978
35
Modeling for text compression (context) - Bell, Witten et al. - 1989
18
Robust transmission of unbounded strings using Fibonacci rep.. (context) - Apostolico, Fraenkel - 1987
16
A compression method for clustered bit-vectors (context) - Teuhola - 1978
16
Enumerative Source Encoding (context) - Cover - 1973
13
Improved hierarchical bitvector compression in document retr.. (context) - Choueka, Fraenkel et al. - 1986
6
Huffman coding in bit-vector compression (context) - Jakobsson - 1978
6
Novel compression of sparse bit-strings (context) - Fraenkel, Klein - 1985
6
An application of informational divergence to Huffman codes (context) - Longo, Galasso - 1982
4
Compression of large inverted files with hyperbolic term dis.. (context) - Schuegraf - 1976
3
Datenbanksysteme II (context) - Wedekind, Harder - 1976
3
Generative models for bitmap sets with compression applicati.. (context) - Bookstein, Klein - 1991
2
Flexible compression for bitmap sets (context) - Bookstein, Klein - 1991
1
Optimal graphs for bit-vector compression (context) - Bookstein, Klein - 1990
Documents on the same site (http://www.cs.biu.ac.il:8080/~tomi/articles.html): More
Efficient Optimal Recompression - Klein (1996)
(Correct)
Complexity Aspects of Guessing Prefix Codes - Fraenkel, Klein (1994)
(Correct)
Is Huffman Coding Dead? - Bookstein, Klein (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC