The deletable Bloom filter: a new member of the Bloom family
Christian Esteve Rothenberg, Carlos Alberto Bráz Macapuna, Fábio Luciano Verdi, Maurício Ferreira Magalhães · IEEE Communications Letters · 2010
We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting elements. The DlBF design enables false-negative-free deletions at a fraction of the cost in memory consumption, which turns to be appealing for certain probabilistic filter applications.