An Improved Construction for Counting Bloom Filters

DOI10.1007/11841036_61zbMath1131.68424OpenAlexW1580997674WikidataQ56384685 ScholiaQ56384685MaRDI QIDQ5449572

Rina Panigrahy, F. Bonomi, Sushil Singh, George Varghese, Michael Mitzenmacher

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_61

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (9)

Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Xor Filters ⋮ Unnamed Item ⋮ Improving counting Bloom filter performance with fingerprints ⋮ Unnamed Item ⋮ A new protocol for the detection of node replication attacks in mobile wireless sensor networks ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Buffered Count-Min Sketch on SSD: Theory and Experiments ⋮ Give me some slack: efficient network measurements

This page was built for publication: An Improved Construction for Counting Bloom Filters