Compressed Bloom filters

DOI10.1145/383962.384004MaRDI QIDQ2787676zbMATH OpenOpenAlexFDO

Authors Michael Mitzenmacher

Publication date 4 March 2016

Published in Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/383962.384004

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

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

Cited in

(18)

• Receiver-oriented design of bloom filters for data-centric routing
• Hardened bloom filters, with an application to unobservability
• Performance/security tradeoffs for content-based routing supported by Bloom filters
• Sliding Bloom Filters
• Optimizing data popularity conscious Bloom filters
• An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
• Less hashing, same performance: Building a better Bloom filter
• Bloomier Filters: A Second Look
• A cache architecture for counting bloom filters: theory and application
• Network Applications of Bloom Filters: A Survey
• scientific article; zbMATH DE number 1875424 (Why is no real title available?)
• Public-key puncturable encryption: modular and compact constructions
• Cache-, hash-, and space-efficient bloom filters
• Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
• Formal Methods in Computer-Aided Design
• A symmetric cryptographic scheme for data integrity verification in cloud databases
• Scalable Bloom filters
• On the false-positive rate of Bloom filters

This page was built for publication: Compressed Bloom filters

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