Predicate priority based event matching algorithm in publish/subscribe system

ISCAS OpenIR

	Predicate priority based event matching algorithm in publish/subscribe system
	Xu, Menglu (1); Lv, Pin (1); Wang, Haibo (1); Xu, Menglu
	2013
会议名称	4th IEEE International Conference on Networking and Distributed Computing, ICNDC 2013
页码	146-150
会议日期	December 21, 2013 - December 24, 2013
会议地点	Hong Kong, China
收录类别	EI
出版地	IEEE Computer Society
ISSN	21654999
ISBN	9781479930463
部门归属	(1) Science and Technology on Integrated Information System Laboratory, Institute of Software Chinese Academy of Sciences, UCAS, Beijing, China
摘要	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.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16673
专题	中国科学院软件研究所
通讯作者	Xu, Menglu
推荐引用方式 GB/T 7714	Xu, Menglu ,Lv, Pin ,Wang, Haibo ,et al. Predicate priority based event matching algorithm in publish/subscribe system[C]. IEEE Computer Society,2013:146-150.