中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Predicate priority based event matching algorithm in publish/subscribe system
Author: Xu, Menglu (1) ; Lv, Pin (1) ; Wang, Haibo (1)
Conference Name: 4th IEEE International Conference on Networking and Distributed Computing, ICNDC 2013
Conference Date: December 21, 2013 - December 24, 2013
Issued Date: 2013
Conference Place: Hong Kong, China
Corresponding Author: Xu, Menglu
Publish Place: IEEE Computer Society
Indexed Type: EI
ISSN: 21654999
ISBN: 9781479930463
Department: (1) Science and Technology on Integrated Information System Laboratory, Institute of Software Chinese Academy of Sciences, UCAS, Beijing, China
Abstract: 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.
English Abstract: 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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16673
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xu, Menglu (1)]'s Articles
[Lv, Pin (1)]'s Articles
[Wang, Haibo (1)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xu, Menglu (1)]‘s Articles
[Lv, Pin (1)]‘s Articles
[Wang, Haibo (1)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace