Construction of optimal graphs for bit-vector compression

A. Bookstein, S. T. Klein
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
more » ... ntly generates a graph structure on the bitmaps. The results ofapplying our algorithm to the Bible is presented: for some sets of bitmaps, our method almost doubled the compression savings.
doi:10.1145/96749.98236 dblp:conf/sigir/BooksteinK90 fatcat:3hm5rxc5lbay7cfsa4o7gm3hf4