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 efficiently generates a graph structure on the bitmaps. The results of applying our algorithm to the Bible is presented: for some sets of bitmaps, our method almost doubled the compression savings.
位图是信息检索中经常出现的数据结构。它们很有用;它们也很大并且存储昂贵。由于这个原因,已经花费了相当大的努力来寻找用于压缩它们的技术。这些技术对于稀疏位图最有效。我们提出了一个预处理阶段,在该阶段中,首先对位图进行聚类,然后使用聚类将其成员位图转换为稀疏的位图,从而可以更有效地对其进行压缩。该聚类方法有效地在位图上生成图形结构。给出了将算法应用于圣经的结果:对于某些位图,我们的方法几乎将压缩节省量提高了一倍。 P>
机译:有界类图的线性时间压缩为信息理论上的最佳位数
机译:用于构造运动表示图和运动过渡事件的最佳参数选择
机译:用于构造运动表示图和运动过渡事件的最佳参数选择
机译:CULZSS-Bit:用于GPGPU上无损数据压缩的位向量算法
机译:中国的shi ... de焦点构造:最优性理论建议
机译:基因组短读取的汉明图:高效施工及其压缩应用
机译:相关位向量的压缩