Cuckoo filter is a compact variant of the Cuckoo hash table, it was proposed by Bin Fan, David Anderson, Michael Kaminsky, and Michael Mitzenmacher in 2014.
Cuckoo filters are easy to implement, they support dynamic additions and deletions, while using less space and achieving even higher performance than other Bloom filter modifications in many practical applications.
Read More:
Probabilistic Data Structures and Algorithms for Big Data Applications by Andrii Gakhov
2019, ISBN: 978-3748190486 (paperback) ASIN: B07MYKTY8W (e-book)
Fan, B., et al. (2014) “Cuckoo Filter: Practically Better Than Bloom”, Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, Sydney, Australia — December 02–05, 2014, pp. 75–88, ACM New York, NY.
Cuckoo filter is a compact variant of the Cuckoo hash table, it was proposed by Bin Fan, David Anderson, Michael Kaminsky, and Michael Mitzenmacher in 2014.
Cuckoo filters are easy to implement, they support dynamic additions and deletions, while using less space and achieving even higher performance than other Bloom filter modifications in many practical applications.
Read More: