计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (28): 10-15.

• 博士论坛 • 上一篇    下一篇

双布鲁姆过滤器法查询集合成员

田小梅1,2,张大方1,史长琼1,杨晓波1   

  1. 1.湖南大学 信息科学与工程学院,长沙 410082
    2.湖南环境生物职业技术学院 信息技术系,湖南 衡阳 421005
  • 出版日期:2012-10-01 发布日期:2012-09-29

Membership queries using double bloom filters

TIAN Xiaomei1,2, ZHANG Dafang1, SHI Changqiong1, YANG Xiaobo1   

  1. 1.School of Information Science and Engineering, Hunan University, Changsha 410082, China
    2.Department of Information Technology, Hunan Environment-Biological Polytechnic, Hengyang, Hunan 421005, China
  • Online:2012-10-01 Published:2012-09-29

摘要: 探讨双布鲁姆过滤器查询法查询集合并集、交集、补集、差集或对称差成员的性能问题。理论分析和实验结果表明,双布鲁姆过滤器查询法能够较好地支持集合并集、交集、补集、差集及对称差的成员查询问题,其中双布鲁姆过滤器并集及交集查询不会产生假阴性,仅有少量假阳性的存在,而双布鲁姆过滤器补集、差集及对称差查询则除存在少量假阳性外,还存在少量假阴性。

关键词: 布鲁姆过滤器, 数据同步, 多关键字检索, 集合调和

Abstract: This paper examines the problem of membership queries for set union, intersection, complementary set, sets difference or symmetric difference between sets by using double Bloom filters. The theoretical analysis and experimental results show that the double-Bloom-filter query method can support membership queries for set union, intersection, complementary set, sets difference or symmetric difference between sets, of which membership queries for set union or intersection have no false negatives, only a few false positives, while membership queries for complementary set, sets difference or symmetric difference have a small number of false negatives in addition to small amounts of false positives.

Key words: Bloom filter, data synchronization, multi-keyword search, set reconciliation