3 ms·
Flower Filter – A simple time-decaying approximate membership filter
- noelwelsh 14y agoInteresting variation on the Bloom filter. One notable difference: in a Bloom filter you say an element is a member of the set if ALL hash values are present. In this case you say an element is a member if ONE hash value is present. This seems to weaken the properties of the Bloom filter quite a lot. Caveat: I only skimmed the article. If I got it wrong, let me know.