Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History

Efficient event matching in a content-based publish/subscribe system is an important problem. Most existing matching solutions focus on subscription relations, such as cover and merge. We observe that event matching can leverage matching history and routing destination as well. Once one of the subscriptions associated with a destination is matched, undecided subscriptions associated with the destination need not be evaluated. Since each different subscription has a different possibilities to match an event, different matching order of subscriptions can result in different matching time. We propose a new efficient event matching approach based on matching order, cover relation, matching history (matching possibility) and routing destination. Our solution indexes subscriptions in an efficient way. Based on event matching history, cover relation and routing destination, our matching approach can cause efficient matching with a special match order, and can easily register or cancel subscriptions. We also propose a highly efficient index structure for numeric filters, which can evaluate N numeric filters with O(logN) time complexity. Quantity analysis of our solution is given. We carry out detailed experimentations to verify the effectiveness of our approach. The results show that our approach achieves high matching efficiency.