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

摘要

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