基于P/S模型的分布对象中间件匹配算法研究  

Matching Research of Asynchronous Communication in Distributed Object-Oriented Middleware Based on P/S Model

作　　者：范明亮[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《计算机与数字工程》2010年第7期24-25,96,共3页Computer & Digital Engineering

摘　　要：高效的匹配算法是大规模基于内容的发布订阅系统所要研究的关键问题之一。建立了订阅语言和事件模型,提出了一个高效、实用的基于内容的匹配算法,它主要研究匹配操作符为"=",充分利用了多维索引技术和AVL搜索树加速查询,这种算法比其它常用算法具有较大提高,并且扩展性好,适合应用于大规模分布式基于内容的发布订阅系统中。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,and its main matching operator is ＂=＂,and presented an efficient and applied matching algorithm that uses multi-dimensional indexing mechanism and AVL search tree to speed up constraints query and this algorithm is significantly more efficient and scalable than other common used matching algorithms in content-based publish-subscribe systems.

关 键 词：发布/订阅模型 分布对象中间件 匹配算法 事件模型 AVL搜索树 

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