The deletable bloom filter: a new member of the bloom family

Authors:
Christian Esteve Rothenberg;Carlos A. B. Macapuna;Fábio L. Verdi;Maurício F. Magalhães
Affiliations:
University of Campinas, Brazil;University of Campinas, Brazil;Federal University of São Carlos, Brazil;University of Campinas, Brazil
Venue:
IEEE Communications Letters
Year:
2010

Citing 8
Cited 1

Summary cache: a scalable wide-area web cache sharing protocol

IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Spectral bloom filters

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An optimal Bloom filter replacement

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An improved construction for counting bloom filters

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives

CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
On the false-positive rate of Bloom filters

Information Processing Letters
LIPSIN: line speed publish/subscribe inter-networking

Proceedings of the ACM SIGCOMM 2009 conference on Data communication

Inferential time-decaying Bloom filters

Proceedings of the 16th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.