The Deletable Bloom filter: A new member of the Bloom family
classification
💻 cs.DS
keywords
bloomfilterdeletabledlbfappealingapplicationscertaincollisions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.