Event Matching and Routing Algorithm in Content-based Publish/subscribe System
Zhang Li
Abstract
Zhang Li
Abstract
Content-based publish/subscribe is a new communication infrastructure.In this system,messages are not given explicit destination addresses by publisher of event,the destinations of a message are determined by matching the content of the message against selection predicates declared by subscriber.Therefore,matching and routing event become two key problems must be solved.The paper analyses some event matching and routing algorithms used by several influential content-based publish/subscribe systems,and discusses characteristic of the algorithms and the scale they can be used within
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Content-based publish/subscribe is a new communication infrastructure.In this system,messages are not given explicit destination addresses by publisher of event,the destinations of a message are determined by matching the content of the message against selection predicates declared by subscriber.Therefore,matching and routing event become two key problems must be solved.The paper analyses some event matching and routing algorithms used by several influential content-based publish/subscribe systems,and discusses characteristic of the algorithms and the scale they can be used within
Key concepts: Computer science, Publication, Event (particle physics), Matching (statistics), Routing (electronic design automation), Key (lock), Distributed computing, Blossom algorithm