Predicate priority based event matching algorithm in publish/subscribe system
文献类型：会议论文
| 作者 | Xu, Menglu (1) ; Lv, Pin (1) ; Wang, Haibo (1) |
| 出版日期 | 2013 |
| 会议名称 | 4th IEEE International Conference on Networking and Distributed Computing, ICNDC 2013 |
| 会议日期 | December 21, 2013 - December 24, 2013 |
| 会议地点 | Hong Kong, China |
| 页码 | 146-150 |
| 通讯作者 | Xu, Menglu |
| 中文摘要 | The large distributed interactive simulation system which based on the publish/subscribe model has considerable data, it needs to disseminate accurate data to the interested users quickly, so improving the match efficient is a very important method to solve this problem. Based on the study and comparison of current matching algorithm, we have proposed a predicate priority based event matching algorithm(hereinafter referred to as PPEM). Performance analysis and detailed experimentations are carried out to verify the effectiveness of PPEM. When the number of subscriptions is 10000, the average time of matching one event is only 22.6ms and when we change the type of data distribution or increase the number of event attribute, the average matching time of PPEM is almost unchangeable comparing with bucket and multi-dimension algorithms. All the results show that PPEM achieves high matching efficiency and also has good scalability and robustness. |
| 英文摘要 | The large distributed interactive simulation system which based on the publish/subscribe model has considerable data, it needs to disseminate accurate data to the interested users quickly, so improving the match efficient is a very important method to solve this problem. Based on the study and comparison of current matching algorithm, we have proposed a predicate priority based event matching algorithm(hereinafter referred to as PPEM). Performance analysis and detailed experimentations are carried out to verify the effectiveness of PPEM. When the number of subscriptions is 10000, the average time of matching one event is only 22.6ms and when we change the type of data distribution or increase the number of event attribute, the average matching time of PPEM is almost unchangeable comparing with bucket and multi-dimension algorithms. All the results show that PPEM achieves high matching efficiency and also has good scalability and robustness. |
| 收录类别 | EI |
| 会议录出版地 | IEEE Computer Society |
| 语种 | 英语 |
| ISSN号 | 21654999 |
| ISBN号 | 9781479930463 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16673]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Xu, Menglu ,Lv, Pin ,Wang, Haibo . Predicate priority based event matching algorithm in publish/subscribe system[C]. 见:4th IEEE International Conference on Networking and Distributed Computing, ICNDC 2013. Hong Kong, China. December 21, 2013 - December 24, 2013. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。