Show HN: A sparse, compressed bitmap index in C. Better than Roaring Bitmaps?

gregburd1 pts0 comments

This is an implementation of a sparse, compressed bitmap index. In the best case, it can store 2048 bits in just 8 bytes. In the worst case, it stores the 2048 bits uncompressed and requires an additional 8 bytes of overhead. It compares favorably against Roaring Bitmaps and other competition in the space, but is it better?

sparse compressed bitmap index better roaring

Related Articles