摘要
基于内容的发布/订阅是一种新型的通信方式。事件的发布者不必给出事件明确的目的地址,事件的目的地址由匹配订阅者申明的订阅消息内容确定。因此,订阅与事件的匹配成为基于内容的发布/订阅系统中面临的关键问题之一。文中提出一种梯形匹配算法。先将所有订阅的约束按一定的规则存储于一个二维数组中,然后利用前一个订阅中某个约束是否匹配成功来判定此后也包含有此约束的订阅是否还需进行匹配,整个算法过程类似于线性代数中的梯形求解矩阵的解的方法。这样可以有效避免不同订阅中包含有相同约束被重复匹配的情况,从而加速事件与订阅的匹配效率,大大减少匹配所需要的时间。
Content-based Publish-subscribe is a new kind of communication. The publishers of events don＇t give specific the address of destination, the address of destination is determined by the matching of subscribe information. Thus, the matching between subscribes and events becomes the one key problem of Content-based Publish-subscribe systems faced. A kind of trapezoid mashing algorithm is raised. Firstly, all constraints of all subscribes are storaged into a two-dimensional array wi ~, a specific rule, then use someone constraint ＂s matching result of previous subscribes to judge whether the behind subscribes which contain the same constraint need to be matched, this algorithm＇s process just like the method of trapezoid solving a matrix＇s solution. It can avoid one constraint is matched many times when one same constraint exists in many subscribes,so that improve the efficiency of matching between subscribes and events,reduce the time of matching.
出处
《计算机技术与发展》
2012年第10期1-4,9,共5页
Computer Technology and Development
基金
国家"973"重点基础研究发展计划项目(2009CB320803)
关键词
发布/订阅
事件匹配
内容匹配
梯形匹配算法
新型通信方式
publish-subscribe
events matching
content matching
trapezoid matching algorithm
new type eommunication
