Improving counting Bloom filter performance with fingerprints

DOI10.1016/j.ipl.2015.11.002zbMath1347.68104OpenAlexW2100632211MaRDI QIDQ903373

Pedro Reviriego, Juan Antonio Maestro, Salvatore Pontarelli

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

zbMATH Keywords

algorithmsdata structuresBloom filters

Mathematics Subject Classification ID

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

Cites Work

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

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