Scalable Bloom filters

DOI10.1016/J.IPL.2006.10.007MaRDI QIDQ845946zbMATH OpenOpenAlexWikidataFDO

Authors Paulo Sérgio Almeida, Carlos Baquero, Nuno Preguiça, David Hutchison

Publication date 29 January 2010

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

Full work available at URL http://hdl.handle.net/1822/6627

zbMATH Keywords

data structuresrandomized algorithmsdistributed systemsBloom filters

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05) Distributed systems (68M14)

Recommendations

• Cache-, hash-, and space-efficient bloom filters
• Bloomier Filters: A Second Look
• An optimal bloom filter replacement
• Compressed Bloom filters
• Network Applications of Bloom Filters: A Survey

Cites work

• scientific article; zbMATH DE number 6469129 (Why is no real title available?)
• An algorithm for approximate membership checking with application to password security
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

Cited in

(10)

• scientific article; zbMATH DE number 6469129 (Why is no real title available?)
• Xor Filters
• Distance-Sensitive Bloom Filters
• Sliding Bloom Filters
• Improving counting Bloom filter performance with fingerprints
• Supporting early pruning in top-\(k\) query processing on massive data
• Less Hashing, Same Performance: Building a Better Bloom Filter
• M-balance matrix Bloom filter
• Detector sherLOCK: Enhancing TRW with bloom filters under memory and performance constraints
• An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique

This page was built for publication: Scalable Bloom filters

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