Ribbon filter: Practically smaller than Bloom and Xor

Re:Ribbon filter: Practically smaller than Bloom and Xor by filmfact on Sunday July 11, 2021 @04:50AM (#27799378)

I skimmed the paper expecting to find a comparison to HyperLogLog, but didn’t find one - am I missing something?

[ Parent | on HN ]

Re:Ribbon filter: Practically smaller than Bloom and Xor by tadkar on Sunday July 11, 2021 @04:58AM (#27799402)

A hyperLogLog is for counting distinct elements. This and Bloom filters are more about checking whether an element has been seen before; a very different use case.

[ Parent | on HN ]

Re:Ribbon filter: Practically smaller than Bloom and Xor by uyt on Sunday July 11, 2021 @06:21AM (#27799735)

Cuckoo filter is the one I thought it would be compared to since I see mentioned on HN a lot: https://hn.algolia.com/?dateRange=all&page=0&prefix=true&que...

And the title seems to be a reference to it too, "Cuckoo Filters, Practically Better Than Bloom"

[ Parent | on HN ]

Re:Ribbon filter: Practically smaller than Bloom and Xor by tadkar on Sunday July 11, 2021 @06:46AM (#27799830)

The paper has a great figure where they illustrate areas of the overhead vs false positive trade-off space where each filter type performs best. Cuckoo filters make an appearance there

[ Parent | on HN ]

Re:Ribbon filter: Practically smaller than Bloom and Xor by mjburgess on Sunday July 11, 2021 @06:32AM (#27799786)

People: no need to downvote someone for asking a question.

[ Parent | on HN ]