Efficient Matching Algorithm for Content-based Publish/Subscribe Systems with Compound Predicates

Abstract

Publish/Subscribe paradigm has been widely used in large-scale distributed systems, as well as in information-centric networks (ICNs) due to its properties of asynchronous, loosely-coupled and many-to-many communications. This paper focuses on matching algorithms which support compound predicates for content-based Publish/Subscribe systems. By using index structures and transforming the complex subscription expressions, our algorithms can not only find proper recipients for emerging events, but also identify matched events for new subscription requests. Theoretical analysis and experimental results show that transforming the subscription expression by appropriate methods can enhance matching efficiency in terms of event and subscription matching time.