An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

DOI10.1016/J.EJOR.2016.01.042MaRDI QIDQ323016zbMATHOpenAlexFDO

Authors Alexei Vernitski, Laura Carrea, Xinan Yang

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://centaur.reading.ac.uk/53947/1/YangVernitskiCarrea-revision2_AV_18012016.pdf

zbMATH Keywords

heuristicsapproximate dynamic programmingBloom filterinteger linear programlossy compression

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Dynamic programming (90C39) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1875424
• Optimizing data popularity conscious Bloom filters
• Compressed Bloom filters
• An optimal bloom filter replacement
• An optimization problem related to Bloom filters with bit patterns

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 140487 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1875424 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
• An approximate dynamic programming approach to multidimensional knapsack problems
• Approximate Dynamic Programming
• Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing
• Dynamic programming and optimal control. Vol. 2
• Less hashing, same performance: Building a better Bloom filter
• Network Applications of Bloom Filters: A Survey
• Optimizing data popularity conscious Bloom filters
• Solving the top-percentile traffic routing problem by approximate dynamic programming
• Space/time trade-offs in hash coding with allowable errors
• The multidimensional 0-1 knapsack problem: an overview.
• Using the Power of Two Choices to Improve Bloom Filters

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

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