期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于Bloom过滤器的服务模糊匹配算法 被引量：3

Bloom Filter Based Assessment Algorithm Supporting Service Fuzzy Matching
下载PDF
导出
摘要 针对基于内容的发布/订阅系统中常用的查找匹配算法要求严格、不能很好地支持服务模糊匹配的问题,提出了一种支持模糊匹配的服务匹配算法。该算法的基本思想是首先将服务与需求分别用两个Bloom过滤器来表示,然后通过比较两个Bloom过滤器比特向量的相似程度,估算需求与服务之间的匹配程度。理论分析及仿真结果表明,此算法可通过简单的Bloom过滤器运算实现基于内容的服务模糊匹配,准确度在95%以上。 The service search algorithms used in content based publish/subscribe system don＇t support service fuzzy matching. A service matching accuracy assessment method based on Bloom filter was presented. Facilitated by this ap- proach, an algorithm that supports service fuzzy matching was proposed. The main idea of this algorithm is using Bloom filter to describe the service and request, and assessing the similarity of service and request by the similarity of Bloom filter vectors. Experimental and theoretical results show that this algorithm can support content-based service fuzzy matching by simple algebraic operations on Bloom filter. The evaluation accuracy rate is beyond 95%.
作者 赵文栋 张进 彭来献 田畅
机构地区 解放军理工大学通信工程学院
出处 《计算机科学》 CSCD 北大核心 2013年第3期175-179,共5页 Computer Science
基金 江苏省自然科学基金(BK2010103)资助
关键词 BLOOM过滤器 模糊匹配 相似度 覆盖度 Bloom filter, Fuzzy matching, Similarity, Coverage
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献24

  • 1Esteve C,Fabio L V,Magalhaes M F.Towards a new generation of information-oriented internetworking architectures[C] //Pro ceeding of CoNEXT '08 Madrid.Spain,2008:305-310.
  • 2Eugster P T H,Felber P A,Guerraoui R,et al.The Many Faces of Publish/Subscribe[J].Computing Surveys,2003,35:114-131.
  • 3Fabret F,Jacobsen H A,Llirbat F,et al.Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems[C] //SIGMOD.ACM,2001:21-24.
  • 4Gough KJ,Smith G.Efficient recognition of events in distributed systems[C] //Proceeding of the 18th Australasian Computer Science Conference.IEEE,1995.
  • 5Aguilera M K,Strom R E,Sturman D C,et al.Matching events in a content-based subscription system[C] //Proceeding of Proceeding of the 18th ACM Symp.on Principles of Distributed Computing.Atlanta,1999.
  • 6Campailla A,Chaki S,Clarke E,et al.Efficient filtering in pub lish-subscribe systems using binary decision diagrams[C] //Pro ceeding of Proceeding of the ICSE 2001.Toronto,2001.
  • 7Diao Y,Altinel M,Franklin M J,et al.Path sharing and predicate evaluation for high-performance XML filtering[J].ACM Transaction Database System,2003,28(4):467-516.
  • 8Peng F,Chawathe S S.XPath queries on streaming data[C] //Proceeding of ACM SIGMOD.New York,2003.
  • 9Bloom B.Space/time trade-offs in hash coding with allowable errors[J].Communications of the ACM,1970,13:422-426.
  • 10Zahemszky A,Esteve C,Rothenberg,et al.LIPSIN:Line Speed Publish/Subscribe Inter-Networking[C] // SIGCOMM'09.IEEE,2009.

二级参考文献45

  • 1王俊峰,杨建华,周虹霞,谢高岗,周明天.网络测量中自适应数据采集方法(英文)[J].软件学报,2004,15(8):1227-1236. 被引量：11
  • 2谢鲲,张大方,谢高岗,文吉刚.基于轨迹标签的无结构P2P副本一致性维护算法[J].软件学报,2007,18(1):105-116. 被引量：23
  • 3谢鲲,闵应骅,张大方,谢高岗,文吉刚.分档布鲁姆过滤器的查询算法[J].计算机学报,2007,30(4):597-607. 被引量：14
  • 4WANG Bang-ju,WANG Yu-hua,NIU Li-ping,ZHANG Huan-guo.Pseudo Random Number Generator Based on Back Propagation Neural Network[J].Semiconductor Photonics and Technology,2007,13(2):164-168. 被引量：3
  • 5Bloom B H. Space/Time Trade-otis in Hash Coding with Allowable Errors[J]. Communication of the ACM, 1970, 13(7): 422-426.
  • 6Fan Li, Cao Pei, Almeida J, et al. Summary Cache: A Scalable Wide-area Web Cache Sharing Protocol[J]. IEEE/ACM Transactions on Networking, 2000, 8(3): 281-293.
  • 7Cohen S, Matias Y. Spectral Bloom Filters[C]//Proceedings of SIGMOD'03. San Diego, California, USA: ACM Press, 2003: 241-252.
  • 8Aguilar-Saborit J, Muntes-Mulero V, Trancoso E et al. Dynamic Count Filters[J]. SIGMOD Record, 2006, 35(1): 26-32.
  • 9Broder A, Mitzenmacher M. Network Applications of Bloom Filters: A Survey[J]. Intemet Mathematics, 2004, 1 (4): 485-509.
  • 10Fan Deng, Rafiei D. Approximately Detecting Duplicates for Streaming Data Using Stable Bloom Filters[C]//Proceedings of SIGMOD'06. Chicago, USA: ACM Press. 2006: 25-36.

共引文献46

同被引文献36

  • 1薛涛,冯博琴.内容发布订阅系统路由算法和自配置策略研究[J].软件学报,2005,16(2):251-259. 被引量：27
  • 2Joung Y,Yang L,Fang C. Keyword search in DHT-based peer- to-peer networks[J]. IEEE JSAC, 2007,25 (1) : 46-61.
  • 3Wang T, Di R H. A Semantic Web Service Discovery Model Based on Pastry SystemiC]//ChlnaGrid. 2010:205-208.
  • 4Liu L, Ryu K D, Lee K. Supporting efficient keyword-based file search in peer-to-peer file sharing systems[C]//GLOBECOM. 2004: 1259-1265.
  • 5Sehmidt C, Parashar M. Enabling flexible queries with guaran- tees in P2P systems[C]//IEEE Interact Oompu. 2004:19-26.
  • 6Tang C, Xu Z, Mahalingam M. PSeareht Information retrieval in structured overlays[C]// ACM SIC, COMM. 2003 : 89-94.
  • 7Rajmohan R, Padmapriya N. A Domain Ontology Based Service Matching for Chord Based Super Peer network[C]// ICDSE. 2012 : 214-219.
  • 8Rosch P,Sattler K,Weth C,et al. Best effort query processing in DHT-based p2p systems[C]//ICDE. 2005:1186-1189.
  • 9Szekeres A, Baranga S H, Dobre C, et al. A Keyword Search AI- gorit/am for Structured Peer-to-Peer Networks [C]//SY-NASC. 2010 : 253-260.
  • 10Zhu Y W, Hu Y M. Ferry: A P2P:Based Architecture for Con- tent-Based Publish/Subscribe Services[J]. IEEE Transactionson Parallel and Distributed Systems, 2007,18(5) : 672-685.

引证文献3

二级引证文献1

计算机科学
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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