Consistently faster and smaller compressed bitmaps with Roaring · HackerPapers discussions

Consistently faster and smaller compressed bitmaps with Roaring — mentioned by wizzard0

Thu, 23 Jan 2025 17:06:26 GMT

what is surprisingly missing from their comparison is roaring bitmaps [0] i'm sure they should've seen this paper because it's quite old [0]: https://arxiv.org/pdf/1603.06549

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

Consistently faster and smaller compressed bitmaps with Roaring — HN submission

Fri, 01 Nov 2024 18:57:07 GMT

Consistently faster and smaller compressed bitmaps with Roaring (2016)

54 points; 8 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Consistently faster and smaller compressed bitmaps with Roaring — mentioned by eatonphil

Mon, 18 Apr 2022 14:08:23 GMT

The main linked paper (of which Daniel Lemire is author) is pretty helpful too. https://arxiv.org/pdf/1603.06549.pdf

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

Consistently faster and smaller compressed bitmaps with Roaring — mentioned by sillysaurusx

Thu, 06 Aug 2020 11:24:54 GMT

Heh, I like the tagline: "Grab one of our research papers". It's very readable, too! https://arxiv.org/pdf/1603.06549.pdf Looks like the last active discussion of Roaring Bitmaps was 6 years ago: https://news.ycombinator.com/item?id=8796997 possibly when it was first introduced. Interesting comments! > How do these compare space and performance wise with Judy arrays, which are 256-ary trees whose nodes also distinguish between sparse and dense subsets? https://en.wikipedia.org/wiki/Judy_array Good question, since the patent on them won't expire until Nov 29, 2020. Judy arrays seem to be much…

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