Improving counting Bloom filter performance with fingerprints

DOI10.1016/J.IPL.2015.11.002zbMATH Open1347.68104OpenAlexW2100632211MaRDI QIDQ903373FDOQ903373

Authors: Salvatore Pontarelli, Pedro Reviriego, Juan Antonio Maestro 

Publication date: 5 January 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.11.002

Recommendations

• An Improved Construction for Counting Bloom Filters
• Less hashing, same performance: Building a better Bloom filter
• Less Hashing, Same Performance: Building a Better Bloom Filter
• Scalable Bloom filters
• Using the Power of Two Choices to Improve Bloom Filters
• An optimal bloom filter replacement
• A cache architecture for counting bloom filters: theory and application

zbMATH Keywords

algorithmsdata structuresBloom filters

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• Space/time trade-offs in hash coding with allowable errors
• Network Applications of Bloom Filters: A Survey
• An Improved Construction for Counting Bloom Filters
• Improving the performance of invertible Bloom lookup tables
• Error Detection and Correction in Content Addressable Memories by Using Bloom Filters

Cited In (2)

• A cache architecture for counting bloom filters: theory and application
• An Improved Construction for Counting Bloom Filters

This page was built for publication: Improving counting Bloom filter performance with fingerprints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903373)