基于B+树的发布/订阅并行匹配算法

Parallel matching algorithm based on B + tree in publish/subscribe system

现有的消息匹配算法不能很好地满足大规模分布式发布/订阅系统中海量数据的有效分发。为此,提出一种高效的发布/订阅并行匹配算法。采用B+树的存储结构,订阅消息按属性-值进行空间划分,建立多级索引订阅属性树,消息匹配采用改进的B+树查询方法,结合计数的思想实现快速消息匹配。实验结果表明,该算法在大规模分布式发布/订阅系统中,消息匹配时间短,订阅匹配树生成迅速,匹配效果更好。

The existing information matching algorithm can not well satisfy the requirements of effective distribution of mass data in large-scale distributed publish/subscribe system.An effective parallel matching algorithm for publish-subscribe system was presented.The storage structure of B + tree was adopted,and subscription information was executed by space division based on the attribute value.Subscription attribute tree with multilevel index was established,and improved B + tree query method was adopted in the information matching,meanwhile,digital idea was combined so as to implement rapid information matching.Experimental results show that the proposed algorithm can implement shorter information matching time and quicker generation of subscription matching tree in the large-scale distributed publish/subscribe system and the results of message matches are better.