2010
DOI: 10.1109/lcomm.2010.06.100344
|View full text |Cite
|
Sign up to set email alerts
|

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

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 65 publications
(29 citation statements)
references
References 9 publications
0
29
0
Order By: Relevance
“…The Deletable Bloom filter (DlBF) [30] addresses the issue of enabling element deletions at a minimal cost in memorycompared to previous variants like the CBFs -and without introducing false negatives. The DlBF is based on a simple yet powerful idea, namely keeping record of the bit regions where collisions happen and exploiting the notion that elements can be effectively removed if at least one of its bits is reset.…”
Section: Deletable Bloom Filtermentioning
confidence: 99%
“…The Deletable Bloom filter (DlBF) [30] addresses the issue of enabling element deletions at a minimal cost in memorycompared to previous variants like the CBFs -and without introducing false negatives. The DlBF is based on a simple yet powerful idea, namely keeping record of the bit regions where collisions happen and exploiting the notion that elements can be effectively removed if at least one of its bits is reset.…”
Section: Deletable Bloom Filtermentioning
confidence: 99%
“…the Bloom filter indicates that some absent elements are present) exists. However, the probability of false positive can be sufficiently reduced by either adjusting the number of hash functions k and the Bloom filter size s or some advanced techniques [14], [15]. We will investigate the effect of the false positive probability in Section 6.…”
Section: Timer-based Bloom Filter Aggregationmentioning
confidence: 99%
“…Simple filters [3,16,7] only allow items to be inserted, and generally represent static sets. Deletable filters [12,14,15] allow items to be deleted as well as inserted, and represent dynamic sets. Decaying filters represent a dynamic set of recently inserted items.…”
Section: Related Workmentioning
confidence: 99%