Issue No. 01 - January (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.57
Deke Guo , National University of Defense Technology, Changsha
Jie Wu , Florida Atlantic University, Boca Raton
Honghui Chen , National university of Defense Technology, Changsha
Ye Yuan , Northeastern University, Shen Yang
Xueshan Luo , National university of Defense Technology, Chagnsha
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 memory than the Bloom filter when representing dynamic sets with an upper bound on set cardinality, and also that the dynamic Bloom filter is more stable than the Bloom filter due to infrequent reconstruction when addressing dynamic sets without an upper bound on set cardinality. Moreover, the analysis results hold in stand-alone applications, as well as distributed applications.
Bloom filters, dynamic Bloom filters, information representation.
D. Guo, X. Luo, H. Chen, Y. Yuan and J. Wu, "The Dynamic Bloom Filters," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 120-133, 2009.