DocumentCode :
170769
Title :
REIN: A fast event matching approach for content-based publish/subscribe systems
Author :
Shiyou Qian ; Jian Cao ; Yanmin Zhu ; Minglu Li
Author_Institution :
Shanghai Jiao Tong Univ., Shanghai, China
fYear :
2014
fDate :
April 27 2014-May 2 2014
Firstpage :
2058
Lastpage :
2066
Abstract :
Event matching is the process of checking high volumes of events against large numbers of subscriptions and is a fundamental issue for the overall performance of a large-scale distributed publish/subscribe system. Most existing algorithms are based on counting satisfied component constraints in each subscription. As the scale of a system grows, these algorithms inevitably suffer from performance degradation. We present REIN (REctangle INtersection), a fast event matching approach for large-scale content-based publish/subscribe systems. The idea behind REIN is to quickly filter out unlikely matched subscriptions. In REIN, the event matching problem is first transformed into the rectangle intersection problem. Then, an efficient index structure is designed to address the problem by using bit operations. Experimental results show that REIN has a better matching performance than its counterparts. In particular, the event matching speed is faster by an order of magnitude when the selectivity of subscriptions is high and the number of subscriptions is large.
Keywords :
data structures; message passing; middleware; REIN approach; bit operations; content-based publish-subscribe systems; distributed publish-subscribe system; fast event matching approach; index structure; rectangle intersection algorithm; rectangle intersection problem; Computers; Conferences; Educational institutions; Indexes; Merging; Routing; Subscriptions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2014 Proceedings IEEE
Conference_Location :
Toronto, ON
Type :
conf
DOI :
10.1109/INFOCOM.2014.6848147
Filename :
6848147
Link To Document :
بازگشت