基于内容的发布/订阅模型中高效的匹配算法

Efficient Matching Algorithm in Content-based Publish/subscribe Model

高效的匹配算法是大规模基于内容的发布订阅系统所要研究的热点问题之一.提出了一种快速有效的算法,算法根据逻辑表达式的特点,对所有订阅按照优先级进行预处理操作,使相同属性的比较次数小于等于1次,从而降低了匹配的代价.适合应用于大规模分布式基于内容的发布订阅系统中.

A key issue when designing and implementing large-scale content-based publish/subscribe systems is how to efficiently match high volumes of events against large numbers of subscription. A fast and efficient al- gorithm is presented, according to the characteristic of logical expression, this algorithm makes pretreatment with all the subscription by the priority, in this way, the comparison of the same attributes is one time or less than one time,there by reducing the cost of matching. Experiment proves that it is more efficient than other commonly used algorithms, and has good expansibility, suits large-scale distributed content-based publish/subscribe system.