Efficient Matching for Content-Based Publish-Subscribe Systems
Jian Dong · Journal of Chinese Computer Systems · 2006
A key issue when designing and implementing large-scale content-based publish/subscribe systems is how to efficiently match high volumes of events against large numbers of subscriptions. This paper, proposed a subscription language and event model, presented an efficient and applied matching algorithm that uses multi-dimensional indexing mechanism to speed up constraints query and exploits the covering relations between constraints to reduce unnecessary matching. Experiments shows that the algorithm is significantly more efficient and scalable than other common used matching algorithms.