Optimizing data popularity conscious bloom filters

DOI10.1145/1400751.1400798zbMath1301.90081OpenAlexW2141173815MaRDI QIDQ2934358

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

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

optimizationdynamic programmingknapsack problemsBloom filters

Mathematics Subject Classification ID

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

Related Items (3)

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters ⋮ An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique ⋮ Adaptive Cuckoo Filters

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