search

armon / bloomd

C network daemon for bloom filters
http://armon.github.io/bloomd
Other
1.24k stars 112 forks source link

Question: cuckoo filter #45

Closed l15k4 closed 7 years ago

l15k4 commented 7 years ago

Hi,

I was wondering, using both bloom and cuckoo filters with different hash functions and thus reducing the collision rate, it would be highly unlikely that both filters could make false positive for the same element, also the overall size/memory footprint and performance would be better.

Ie. using both bloom and cuckoo filters with high FPP (0.01) would lead to wayyy lower collision rate than using only Bloom or Cuckoo filter with low FPP (0.00001) and it would be faster and smaller.

Have you considered adding support for https://github.com/efficient/cuckoofilter ?

armon commented 7 years ago

@l15k4 It definitely looks interesting, I haven't considered it, as the algorithm was published after bloomd was written! It would be an neat extension, unfortunately I don't have time for that large of a change as the project is mostly in maintenance mode now. Would be open to a PR potentially, and happy to talk through a design doc!