期刊文献+

布鲁姆过滤器代数运算探讨 被引量:8

Algebraic Operations on Bloom Filters
在线阅读 下载PDF
导出
摘要 本文探讨布鲁姆过滤器的代数运算和集合查询的关系,定义布鲁姆过滤器的"并","交","异或","补","差"代数运算,从理论和实验两方面分析布鲁姆过滤器的代数运算和集合代数运算并集,交集,异或集,补集,差集的元素查询关系.理论分析和实验结果表明,布鲁姆过滤器的"并","交"运算能够支持集合并集交集的元素查询,这一结论可以简化利用布鲁姆过滤器进行的系统设计. This paper discusses the relationship between algebraic operations on Bloom filters and algebraic operations on data sets. This paper completely define algebraic operations including OR, AND, XOR, NOT, MINUS on Bloom filter, and study the membership query performance on Bloom filter and data set. Theoretical analyses and simulation results show that the Bloom filter ORed (ANDed) from the original Bloom filters can support element membership query on data set ORed (ANDed) from the original data sets, which can be a nick to real application.
出处 《电子学报》 EI CAS CSCD 北大核心 2008年第5期869-874,共6页 Acta Electronica Sinica
基金 国防基础科研“十一五”规划(No.A1420060162)
关键词 计算机网络 分布式计算 分布式消息系统 集合元素查询 代数运算 computer networks distributed computing distributed information system set membership query algebraic operations
  • 相关文献

参考文献10

  • 1Burton H B.Space/time trade-offs in hash coding with allowable errors[ J]. Commun. ACM, 1970,13(7) :422 - 426.
  • 2谢鲲,张大方,谢高岗,文吉刚.基于轨迹标签的无结构P2P副本一致性维护算法[J].软件学报,2007,18(1):105-116. 被引量:23
  • 3Broder A, et al. Network applications of Bloom filters: a survey[J]. Intemet Mathematics, 2003,1 (4) : 485 - 509.
  • 4Bonomi F, et al. Beyond bloom filters:From approximate membership checks to approximate state machines [ J ]. Computer Communication Review, 2006,36 (4) : 315 - 326.
  • 5谢鲲,闵应骅,张大方,谢高岗,文吉刚.分档布鲁姆过滤器的查询算法[J].计算机学报,2007,30(4):597-607. 被引量:14
  • 6Fan L,et al. Summary cache:A scalable wide-area Web cache sharing protocol [ J ]. Ieee-Acm Transactions on Networking, 2000,8(3) :281 - 293.
  • 7Kun X, et al. A scalable bloom filter for membership queries [ A]. Proceedings of IEEE Globecom [ C ]. Washington D. C. USA:IEEE Computer Society,2007.
  • 8Guo D k, et al. Theory and network application of dynamic Bloom filters[ A], Proceedings of IEEE Infocom[ C ]. SPAIN: IEEE Computer Society,2006.1 - 10.
  • 9Saar C,et al. Spectral Bloom filters[A]. Proceedings of ACM SIGMOD Intemafional Conference on Management of Data [C]. San Diego, California: ACM Press, 2003.241 - 252.
  • 10Mitzenmacher M. Compressed bloom filters [ J ]. Ieee-Acm Transactions on Networking,2002,10(5) :604 - 612.

二级参考文献26

  • 1姜彩萍,李子木,杨凤杰.集中管理式Web缓存系统及性能分析[J].小型微型计算机系统,2004,25(8):1428-1431. 被引量:10
  • 2窦文,王怀民,贾焰,邹鹏.模拟谣言传播机制的无结构P2P网络中广播机制的研究[J].计算机研究与发展,2004,41(9):1460-1465. 被引量:20
  • 3Bloom B.Space/time trade-offs in hash coding with allowable errors.Communications of the ACM,1970,13(7):422-426
  • 4Mullin J K.Optimal semijoins for distributed database systems.IEEE Transactions on Software Engineering,1990,16(5):558-560
  • 5McIlroy M.Development of a spelling list.IEEE Transactions on Communications,1982,30(1):91-99
  • 6Druschel P,Rowstron A.PAST,a large-scale,persistent peer-to-peer storage utility//Proceedings of the 8th Workshop on Hot Topics in Operations Systems.Elmau/Oberbayern,Germany,2001.Washington,DC,USA,2001:65-70
  • 7Stoica I,Morris R,Karger D et al.Chord:A scalable peerto-peer lookup service for Internet applications//Proceedings of the ACM SIGCOMM.San Francisco,USA,2001:149-160
  • 8Ratnasamy S,Francis P,Handley M et al.A scalable content-addressable network//Proceedings of the ACM SIGCOMM.San Francisco,2001:161-172
  • 9Rhea S C,Kubiatowicz J.Probabilistic location and routing//Proceedings of the INFOCOM2002.New York,2002.Washington,DC,USA,2002:1248-1257
  • 10Whitaker A,Wetherall D.Forwarding without loops in Icarus//Proceedings of the Open Architectures and Network Programming.New York,USA,2002:63-75

共引文献32

同被引文献83

引证文献8

二级引证文献48

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部