DATE: Oct 9, 2020 (Friday)
TIME: 11:45 am EST

SPEAKER: Michael Bender

TITLE: Filters

ABSTRACT: A Bloom filter maintains a compact, probabilistic representation of a set S of keys from a universe U. The price of being small is that there is a (bounded) probability of false positives. This talk reviews alternative filter designs, focusing on quotient and cuckoo filters. These newer filters are faster, more space efficient, and support a broader range of operations. We focus on both the theoretical and engineering issues that arise.