Better bitmap performance with Roaring bitmaps · HackerPapers discussions

Better bitmap performance with Roaring bitmaps — mentioned by kuwze

Sat, 06 Oct 2018 22:08:49 GMT

Edit: I misspoke. It seems that they did a very thorough comparison with Word Aligned Hybrid compression scheme. I was just searching the PDFs for 'fastbit'. Past discussion of Roaring bitmaps[0]. I find it interesting that there is no real comparison (at least under the publications at the home page[1]) between Roaring bitmaps and FastBit[2] except for this little quote from 'Better bitmap performance with Roaring bitmaps' [3]: Our approach is reminiscent of O’Neil and O’Neil’s RIDBit external-memory system. RIDBit is a B-tree of bitmaps, where a list is used instead when a chunk’s density…

Paper and discussion history. A mention is not an endorsement.

Better bitmap performance with Roaring bitmaps — mentioned by willglynn

Tue, 12 Dec 2017 05:10:56 GMT

There are a lot of tools available in the "compressed bitmap" space. When last I needed something like this, I evaluated several approaches and ended up selecting Roaring Bitmaps: https://arxiv.org/abs/1402.6407 http://roaringbitmap.org That application had some particular wins relating to large sparse bitmaps, especially the ability to efficiently perform binary operations directly on their compressed representations. I didn't need random insertions, so this ended up being a win across the board: faster runtime, lower memory footprint, and lower I/O requirements versus a normal bitset.

Paper and discussion history. A mention is not an endorsement.