The Dynamic Bloom Filters

—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter and its variants just focus on how to represent a static set and decrease the false positive probability to a sufficiently low level. By investigating mainstream applications based on the Bloom filter, we reveal that dynamic data sets are more common and important than static sets. However, existing variants of the Bloom filter cannot support dynamic data sets well. To address this issue, we propose dynamic Bloom filters to represent dynamic sets, as well as static sets and design necessary item insertion, membership query, item deletion, and filter union algorithms. The dynamic Bloom filter can control the false positive probability at a low level by expanding its capacity as the set cardinality increases. Through comprehensive mathematical analysis, we show that the dynamic Bloom filter uses less expected me...

• Type: Journal
• Year: 2010
• Where: TKDE
• Authors: Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan Luo
• Keywords: Bloom Filter, Dynamic Bloom Filter, False Positive Probability, TKDE 2010