Optimizing data popularity conscious Bloom filters

DOI10.1145/1400751.1400798MaRDI QIDQ2934358zbMATH OpenOpenAlexFDO

Authors Ming Zhong, Pin Lü, Kai Shen, Joel I. Seiferas

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

Bloom filtersdynamic programmingknapsack problemsoptimization

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Approximation algorithms (68W25) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• Cache-, hash-, and space-efficient bloom filters
• Compressed Bloom filters
• An optimal bloom filter replacement
• Network Applications of Bloom Filters: A Survey
• On the analysis of Bloom filters

Cited in

(11)

• Receiver-oriented design of bloom filters for data-centric routing
• Compressed Bloom filters
• Sliding Bloom Filters
• The power of 1 + for memory-efficient Bloom filters
• An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
• Using the Power of Two Choices to Improve Bloom Filters
• Optimal Bloom filters and adaptive merging for LSM-trees
• Inferring insertion times and optimizing error penalties in time-decaying Bloom filters
• An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
• An optimization problem related to Bloom filters with bit patterns
• Adaptive Cuckoo Filters

This page was built for publication: Optimizing data popularity conscious Bloom filters

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