Two seemingly unrelated problems - set reconcilation and approximate membership queries - that can both be solved elegantly using a technique called peeling algorithms. Today we explore what peeling algorithms are and how to apply them.
Readings
- Michael Goodrich and Michael Mitzenmacher. Invertible Bloom Lookup Tables
- Thomas Graf and Daniel Lemire. Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
Links