Comment on Two Bits Are Better Than One: making bloom filters 2x more accurateparentComments−vanderZwan6moAre you talking about Cuckoo++ tables, perhaps? If not can you point me to the hash table you had in mind? Always fun to learn of a new approach.https://github.com/technicolor-research/cuckoopp−Sesse__6moIIRC, it's this paper: https://db.in.tum.de/~birler/papers/hashtable.pdfI never implemented their hash table, but it opened my eyes to the technique of a tiny Bloom filter, which I've used now a couple of times to fairly good (if small) effect. :-)−vanderZwan6moThanks! This'll be a fun read :)
Comments
Are you talking about Cuckoo++ tables, perhaps? If not can you point me to the hash table you had in mind? Always fun to learn of a new approach.
https://github.com/technicolor-research/cuckoopp
IIRC, it's this paper: https://db.in.tum.de/~birler/papers/hashtable.pdf
I never implemented their hash table, but it opened my eyes to the technique of a tiny Bloom filter, which I've used now a couple of times to fairly good (if small) effect. :-)
Thanks! This'll be a fun read :)