Scalable Bloom filters

DOI10.1016/J.IPL.2006.10.007zbMATH Open1184.68197OpenAlexW2064803799WikidataQ56384683 ScholiaQ56384683MaRDI QIDQ845946FDOQ845946

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

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

zbMATH Keywords

data structuresrandomized algorithmsdistributed systemsBloom filters

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Space/time trade-offs in hash coding with allowable errors
• An algorithm for approximate membership checking with application to password security
• Network Applications of Bloom Filters: A Survey

Cited In (10)

• Title not available (Why is that?)
• Xor Filters
• Distance-Sensitive Bloom Filters
• Sliding Bloom Filters
• Improving counting Bloom filter performance with fingerprints
• Less Hashing, Same Performance: Building a Better Bloom Filter
• M-balance matrix Bloom filter
• Supporting early pruning in top-\(k\) query processing on massive data
• 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)