Distance-Sensitive Bloom Filters

DOI10.1137/1.9781611972863.4MaRDI QIDQ5233465zbMATH OpenOpenAlexFDO

Authors Adam Kirsch, Michael Mitzenmacher

Publication date 11 September 2019

Published in 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2815e8f3bb3ae3bb25a7220dd91f307f3321ed6b

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Distance sensitive Bloom filters without false negatives
• Scalable Bloom filters
• Multi-Granularity Locality-Sensitive Bloom Filter
• On the analysis of Bloom filters
• On the false-positive rate of Bloom filters
• An optimal bloom filter replacement
• Locality-Sensitive Bloom Filter for Approximate Membership Query

Cited in

(5)

• Receiver-oriented design of bloom filters for data-centric routing
• Sliding Bloom Filters
• Distance sensitive Bloom filters without false negatives
• Tight bounds for sliding Bloom filters
• Capacity analysis of vector symbolic architectures

This page was built for publication: Distance-Sensitive Bloom Filters

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