2010/05/03 by Christian Esteve Rothenberg, Rothenberg, Christian Esteve, Carlos A. B. Macapuna +8
Computer Science · Materials Science · #Caching and Content Delivery #Carbon and Quantum Dots Applications #Covalent Organic Framework Applications #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS
paper · pdf · doi:10.48550/arxiv.1005.0352
3 pages, 4 figures. To appear in IEEE Comm Letters
arxiv created 2010/05/03 · openalex publication_date 2010/05/03 · arxiv updated 2010/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.