计算机科学 ›› 2013, Vol. 40 ›› Issue (3): 175-179.

• 网络与通信 • 上一篇    下一篇

一种基于Bloom过滤器的服务模糊匹配算法

赵文栋,张进,彭来献,田畅   

  1. (解放军理工大学通信工程学院 南京 210007)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Bloom Filter Based Assessment Algorithm Supporting Service Fuzzy Matching

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对基于内容的发布/订阅系统中常用的查找匹配算法要求严格、不能很好地支持服务模糊匹配的问题,提 出了一种支持模糊匹配的服务匹配算法。该算法的基本思想是首先将服务与需求分别用两个Bloom过滤器来表示, 然后通过比较两个Bloom过滤器比特向量的相似程度,估算需求与服务之间的匹配程度。理论分析及仿真结果表 明,此算法可通过简单的Bloom过滤器运算实现基于内容的服务模糊匹配,准确度在95%以上。

关键词: Bloom过滤器,模糊匹配,相似度,覆盖度

Abstract: 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 reduest, and assessing the similarity of service and reduest 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 0 o.

Key words: Bloom filter, Fuzzy matching, Similarity, Coverage

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!