基于内容的发布订阅系统中快速匹配算法的研究  

Efficient Matching for Content-Based Publish-Subscribe Systems

作　　者：薛涛[1] 冯博琴[1] 李波[1] 董剑[1] 

机构地区：[1]西安交通大学计算机教学实验中心,陕西西安710049

出　　处：《小型微型计算机系统》2006年第3期529-533,共5页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划基金项目(2003AA001048)资助.

摘　　要：高效的匹配算法是大规模基于内容的发布订阅系统所要研究的关键问题之一.建立了订阅语言和事件模型,提出了一个高效、实用的基于内容的匹配算法,它充分利用了多维索引技术加速查询,利用约束间的覆盖关系减少重复匹配.实验表明其效率比其它常用算法具有较大提高,并且扩展性好,适合应用于大规模分布式基于内容的发布订阅系统中.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 subscriptions. This paper, proposed a subscription language and event model, presented an efficient and applied matching algorithm that uses multi-dimensional indexing mechanism to speed up constraints query and exploits the covering relations between constraints to reduce unnecessary matching. Experiments shows that the algorithm is significantly more efficient and scalable than other common used matching algorithms.

关 键 词：发布/订阅 内容匹配 多维索引 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]