Match-Ladder: An efficient event matching algorithm in large-scale content-based publish/subscribe system

To resolve high-performance content-based event matching problem for large-scale publish/subscribe systems, we have focused on how to use some priori knowledge to improve the efficiency. In this paper, by theoretically analyzing the inherent problem of the matching order of predicates, we propose a matching algorithm called Match-Ladder which based on the best matching order. The Match-Ladder can achieve better trade-off between time efficiency and the usage of memory space. It has been verified through both mathematical and simulation-based evaluation.

[1]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[2]  Tao Xue,et al.  A Fast Matching Algorithm for Content-Based Publish/Subscribe Systems , 2013 .

[3]  Yiming Hu,et al.  Ferry: A P2P-Based Architecture for Content-Based Publish/Subscribe Services , 2007, IEEE Transactions on Parallel and Distributed Systems.

[4]  Tom Fawcett,et al.  Activity monitoring: noticing interesting changes in behavior , 1999, KDD '99.

[5]  Gong Zhen-yu.  Content-based effective event matching algorithm , 2011 .

[6]  Haibo Wang,et al.  Predicate Priority Based Event Matching Algorithm in Publish/Subscribe System , 2013, 2013 Fourth International Conference on Networking and Distributed Computing.

[7]  Jaswinder Pal Singh,et al.  Analysis and algorithms for content-based event matching , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[8]  Jie Wu,et al.  Towards Approximate Event Processing in a Large-Scale Content-Based Network , 2011, 2011 31st International Conference on Distributed Computing Systems.

[9]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[10]  John Edward Gough,et al.  Efficient Recognition of Events in a Distributed System , 1995 .

[11]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[12]  Sergei Vassilvitskii,et al.  Efficiently evaluating complex boolean expressions , 2010, SIGMOD Conference.

[13]  F. Al-Shamali,et al.  Author Biographies. , 2015, Journal of social work in disability & rehabilitation.

[14]  Pei Zhao,et al.  Marshmallow: A Content-Based Publish-Subscribe System over Structured P2P Networks , 2011, 2011 Seventh International Conference on Computational Intelligence and Security.