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

@article{EsteveRothenberg2010TheDB,
  title={The deletable Bloom filter: a new member of the Bloom family},
  author={Christian Esteve Rothenberg and Carlos Alberto Braz Macapuna and F{\'a}bio Luciano Verdi and Maur{\'i}cio F. Magalh{\~a}es},
  journal={IEEE Communications Letters},
  year={2010},
  volume={14}
}
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. 
An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
TLDR
An insight survey on bloom filter and its variants is presented and the applications and issues are discussed and will highly benefit the research community working in this field. Expand
Addition of a Secondary Functional Bloom Filter
TLDR
This letter analytically presents the memory ratio allocated for each of the two Bloom filters to achieve the lowest search failure rate and demonstrates that the optimal performance is realized when the secondary functional Bloom filter uses 3% of the total memory. Expand
A Fingerprint-based Bloom Filter with Deletion Capabilities
TLDR
A new filter called the D-FP (Deletable Fingerprint) Bloom filter that stores two-bit fingerprints, instead of a single bit or a counter, that can indicate whether the item can be deleted, providing lower false positive rates than the TBF at low filter occupancies and better deletability than the DlBF thus providing more options to desginers that want to trade-off both parameters. Expand
A short survey on bloom filter and its variants
  • Divya Gupta, Shalini Batra
  • Computer Science
  • 2017 International Conference on Computing, Communication and Automation (ICCCA)
  • 2017
TLDR
Many applications utilize Probabilistic Data Structure (PDS) to reduce data storage and data processing cost and can be efficiently used for big data processing and streaming applications. Expand
Yes-no Bloom filter: A way of representing sets with fewer false positives
TLDR
This paper proposes the yes-no BF, a new way of representing a set, based on the BF, but with significantly lower false positives and no false negatives, and shows that it has better false positive performance than the BF. Expand
In-packet Bloom filters: Design and networking applications
TLDR
The main contributions are exploring the design space and the evaluation of a series of extensions to increase the practicality and performance of iBFs, to enable false-negative-free element deletion, and to provide security enhancements. Expand
Shed More Light on Bloom Filter's Variants
TLDR
In this paper, in-depth insight on the Bloom Filter is presented, and the prominent variants of the Bloom Filters are presented. Expand
A Bloom Filter Survey: Variants for Different Domain Applications
TLDR
The main aim of this work is to provide an overall comparison between the variants of the Bloom filter structure according to the application domain that it fits in. Expand
Ternary Bloom filter replacing counting Bloom filter
TLDR
This paper proposes a Ternary Bloom filter (TBF) which is a variation of the CBF that is motivated to use the minimum number of bits for each counter and constructs a larger Bloom filter instead. Expand
A High-Performance Double-Layer Counting Bloom Filter for Multicore Systems
TLDR
A novel architecture of double-layer counting Bloom filter (DLCBF) to reduce the unnecessary data lookups on the local cache and redundant data transactions on the shared interconnection of an SMP system. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
An Improved Construction for Counting Bloom Filters
TLDR
A simple hashing-based alternative based on d- left hashing called a d-left CBF (dlCBF), which offers the same functionality as a CBF, but uses less space, generally saving a factor of two or more. Expand
On the false-positive rate of Bloom filters
TLDR
It is shown that Bloom's analysis is incorrect and give a correct analysis of randomized data structure for membership queries dating back to 1970. Expand
On the false-positive rate of Bloom filters
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the proba...
Spectral bloom filters
TLDR
The Spectral Bloom Filter is introduced, an extension of the original Bloom Filter to multi-sets, allowing the filtering of elements whose multiplicities are below a threshold given at query time. Expand
Bloom filters: Design innovations and novel applications
TLDR
The paper shows that this approach is a promising alternative to expensive CAM or hash table lookups, and suggests a method of building cheap “fuzzy” flow memories. Expand
Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives
TLDR
The retouched Bloom filter (RBF) is introduced, an extension that makes the Bloom filter more flexible by permitting the removal of selected false positives at the expense of generating random false negatives. Expand
An optimal Bloom filter replacement
TLDR
A new RAM data structure is considered for storing an approximation of S to S such that S ⊆ S and any element not in S belongs to S with probability at most ∈, and the space usage is within a lower order term of the lower bound. Expand
Space/time trade-offs in hash coding with allowable errors
In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a give...
Summary cache: a scalable wide-area web cache sharing protocol
TLDR
This paper demonstrates the benefits of cache sharing, measures the overhead of the existing protocols, and proposes a new protocol called "summary cache", which reduces the number of intercache protocol messages, reduces the bandwidth consumption, and eliminates 30% to 95% of the protocol CPU overhead, all while maintaining almost the same cache hit ratios as ICP. Expand
Space/time trade-offs in hash coding with allowable errors
TLDR
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time. Expand
...
1
2
...