Bloom Filters: More than a space-efficient hashmap

Re:Bloom Filters: More than a space-efficient hashmap by ozankabak on Wednesday August 11, 2021 @09:36AM (#28141785)

Where can I find more information about the "Succinct counting blocked Bloom filter"? Can you point to an implementation or a document? Thanks.

[ Parent | on HN ]

Re:Bloom Filters: More than a space-efficient hashmap by thomasmg on Wednesday August 11, 2021 @09:45AM (#28141856)

Sure. So far, there are only two Java implementations. One is using "Rank" and the other is using "Select":

https://github.com/FastFilter/fastfilter_java/blob/master/fa...

It should be relatively easy to port it to other programming languages.

Compared to regular counting Bloom filters, there are some advantages (e.g. uses half the space, lookup is much faster, no risk of overflows). It has a disadvantage: add+remove are slower (currently). Cuckoo filters need less space, but otherwise advantages+disadvantages are the same.

For more questions, just open an issue on that project (I'm one of the authors).

[ Parent | on HN ]

Re:Bloom Filters: More than a space-efficient hashmap by ozankabak on Thursday August 12, 2021 @01:18PM (#28158928)

Thank you!

[ Parent | on HN ]