| 一种基于谓词覆盖技术的启发式事件匹配算法 |
| |
| 引用本文： | 张凯隆,庄艳,陈继明,徐丹,潘金贵.一种基于谓词覆盖技术的启发式事件匹配算法[J].计算机应用与软件,2010,27(6):1-4,13. |
| |
| 作者姓名： | 张凯隆 庄艳 陈继明 徐丹 潘金贵 |
| |
| 作者单位： | 南京大学软件新技术国家重点实验室,江苏,南京,210093 |
| |
| 摘 要： | 基于内容路由的发布/订购(Pub/Sub)技术具有异步、松散耦合和多对多通信等特点,使得它能更好地应用于大规模分布式交互系统.而高效率的发布事件匹配算法是实现基于内容路由的大规模Pub/Sub系统所要解决的关键问题.针对基于内容的发布/订购模型主要性能的事件匹配问题做了重点研究,提出了谓词关系(二叉树)的概念.并在此基础上,通过将谓词覆盖技术同启发式匹配策略相结合,设计并实现了启发式发布事件匹配算法--PRBT-Match算法.实验结果表明,PRBT-Match算法相对于其他常用匹配算法有更好的匹配性能.
|
| 关 键 词： | 发布/订购 基于内容路由 谓词覆盖 PRBT-Match算法 |
A HEURISTIC EVENT MATCHING ALGORITHM BASED ON PREDICATE COVERING |
| |
| Zhang Kailong,Zhuang Yan,Chen Jiming,Xu Dan,Pan Jingui.A HEURISTIC EVENT MATCHING ALGORITHM BASED ON PREDICATE COVERING[J].Computer Applications and Software,2010,27(6):1-4,13. |
| |
| Authors: | Zhang Kailong Zhuang Yan Chen Jiming Xu Dan Pan Jingui |
| |
| Affiliation: | Zhang Kailong Zhuang Yan Chen Jiming Xu Dan Pan Jingui(State Key Laboratory of Novel Software Technology,Nanjing University,Nanjing 210093,Jiangsu,China) |
| |
| Abstract: | The content-based routing publish/subscribe system is able to be adapted to large-scale distributed interactive applications better due to its asynchronous,many-to-many and loosely-coupled communication properties.Efficient matching algorithm for event publishing is the key issue to be resolved in realising the large-scale content-based routing publish/subscribe system.In the paper,we emphatically studied the event matching issue of substantial properties of the content-based publish/subscribe model,and pro... |
| |
| Keywords: | Publish/Subscribe Content-based routing Predicate covering PRBT-Match algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
