Abstract
In Message-Oriented Middleware with Pub/Sub model on TT&C computer, the clients are only responsible for sending messages to Pub/Sub services, the matching and forwarding of messages should be executed by Pub/Sub service. so the efficiency of matching algorithm is an important factor influencing the system real-time performance. A matrix matching algorithm is proposed in this paper. Firstly put all subscriptions under one theme into a matrix (m×n)of 0, 1 with preprocessing, m means the number of subscriptions, n means the total number of predicates. When one event is released, if it does not match with a predicate, delete all subscriptions containing the predicate. Experiments show that the efficiency of matrix matching algorithm is higher than traditional predicate counting algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
