The Deletable Bloom filter: A new member of the Bloom family

Details The Deletable Bloom filter: A new member of the Bloom family The Deletable Bloom filter: A new member of the Bloom family

2010-05-03

arxiv.org/abs/1005.0352v1

Computer Science

Data Structures and Algorithms

3 pages, 4 figures. To appear in IEEE Comm Letters

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Deletable Bloom filter: A new member of the Bloom family does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Deletable Bloom filter: A new member of the Bloom family, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Deletable Bloom filter: A new member of the Bloom family will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659065