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

摘要

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