A. Bookstein, S.T. Klein  Home/Search
Context Related
| cs.biu.ac.il:8080/~tomi/Pos...infsys.ps cs.biu.ac.il/~tomi/Postscri...infsys.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.biu.ac.il:8080/~tom...articles (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : Bitmaps are data structures occurring often in information retrieval. They are useful; they are also large and expensive to store. For this reason, considerable effort has been devoted to finding techniques for compressing them. These techniques are most effective for sparse bitmaps. We propose a preprocessing stage, in which bitmaps are first clustered and the clusters used to transform their member bitmaps into sparser ones, that can be more effectively compressed. The clustering method... (Update)
Context of citations to this paper: More
...of documents. Table 1 shows the sizes of these collections. The collection Manuals was a collection of Unix manual pages ( usr man man[1 8] on a Sun SPARCstation) including embedded formatting commands. Collection GNUbib [18] stores 64,000 citations to journal articles,...
...in various contexts in communication network design. It has also been given some applications in the area of information retrieval in [BK90, BK91] There, shallow trees are used to efficiently compress a collection An extended abstract of this work was presented at the Eighth...
Cited by: More
Greedy Heuristics and an Evolutionary Algorithm for the.. - Raidl, Julstrom (2003) (Correct)
Random-Tree Diameter and the DiameterConstrained MST - Abdalla, Deo, Gupta (2000) (Correct)
The Link Database: Fast Access to Graphs of the Web - Randall, Stata.. (2001) (Correct)
Active bibliography (related documents): More All
1.0: Models of Bitmap Generation: A Systematic Approach to Bitmap .. - Bookstein, Klein (1992) (Correct)
0.8: Storing Text Retrieval Systems on CD-ROM: Compression.. - Klein, Bookstein.. (1989) (Correct)
0.5: Parameterised Compression for Sparse Bitmaps - Moffat, Zobel (1992) (Correct)
Similar documents based on text: More All
0.5: Optimizing Queries On Compressed Bitmaps - Amer-Yahia, Johnson (2000) (Correct)
0.4: Photo-Realistic Talking-Heads from Image Samples - Cosatto, Graf (2000) (Correct)
0.3: Compressing Bitmap Indexes for Faster Search Operations - Wu, Otoo, Shoshani (2002) (Correct)
Related documents from co-citation: More All
2: Approximating shallow-light trees (context) - Kortsarz, Peleg - 1997
2: Arithmetic Coding for Data Compression (context) - Witten, Neal et al.
2: Generalized submodular cover problems and applications (context) - Bar-Ilan, Kortsarz et al. - 1996
BibTeX entry: (Update)
Bookstein, A. and Klein, S.T. (1991) Compression of correlated bit-vectors. Information Systems 16(4): 387-- 400. http://citeseer.ist.psu.edu/article/bookstein90compression.html More
@article{ bookstein91compression,
author = "Abraham Bookstein and Shmuel T. Klein",
title = "Compression of correlated bit-vectors",
journal = "Information Systems",
volume = "16",
number = "4",
pages = "387-400",
year = "1991",
url = "citeseer.ist.psu.edu/article/bookstein90compression.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
2003 The Art of Computer Programming (context) - Knuth - 1973
1120 Handbook of Mathematical Functions (context) - Abramowitz, Stegun - 1965
95 Computer Science Press (context) - Storer - 1988
50 Signature files: An access method for documents and its anal.. (context) - Faloutsos, Christodulakis - 1984
48 Data Compression - Lelewer, Hirschberg - 1987
41 the shortest spanning subtree of a graph and the Travelling .. (context) - Kruskal - 1956
35 Modeling for Text Compression (context) - Bell, Witten et al. - 1989
24 Storing Text Retrieval Systems on CD-ROM: Compression and En.. - Klein, Bookstein et al. - 1989
16 A Compression method for Clustered Bit-Vectors (context) - Teuhola - 1978
13 Improved hierarchical bit-vector compression in document ret.. (context) - Choueka, Fraenkel et al. - 1986
13 Mathematical analysis of various superimposed coding methods (context) - Stiassny - 1960
10 Improved Techniques for Processing Queries in Full-Text Syst.. (context) - Choueka, Fraenkel et al. - 1987
7 jEj log log jV j) algorithm for finding minimum spanning tre.. (context) - An - 1975
6 Huffman coding in Bit-Vector Compression (context) - Jakobsson - 1978
6 Novel Compression of sparse Bit-Strings (context) - Fraenkel, Klein - 1985
4 Using Bitmaps for Medium Sized Information Retrieval Systems - Bookstein, Klein - 1990
4 Compression of large inverted files with hyperbolic term dis.. (context) - Schuegraf - 1976
3 Datenbanksysteme II (context) - Wedekind, Harder - 1976
2 the use of bit-maps for multiple key retrieval (context) - Vallarino - 1976
The graph only includes citing articles where the year of publication is known.
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