A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Construction of optimal graphs for bit-vector compression
1990
Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '90
Bitmaps are data structures occurring oilen in information retrieval. They are useful; they are abo 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
doi:10.1145/96749.98236
dblp:conf/sigir/BooksteinK90
fatcat:3hm5rxc5lbay7cfsa4o7gm3hf4