By Topic

Predicate matching and subscription matching in Publish/Subscribe systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ashayer, G. ; Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada ; Leung, H.K.Y. ; Jacobsen, H.-A.

An important class of publish/subscribe matching algorithms work in two stages. First, predicates are matched and then matching subscriptions are derived. We observe that in practice, the domain types over which predicates are defined are often of fixed enumerable cardinality. Based on this observation we propose a table-based look-up scheme for fast predicate evaluation that finds all matching predicates for each type with one table lookup. We compare this scheme to alternative general-purpose implementations. This observation may also suggests that matching in publish/subscribe systems could equally well be implemented with standard database technology. We propose two DBMS-based matching algorithms and compare the better one with a special purpose publish/subscribe matching algorithm implementation. We provide first evidence that for application scenarios that require large subscription workloads and process many events a DBMS-based solution is not a feasible alternative.

Published in:

Distributed Computing Systems Workshops, 2002. Proceedings. 22nd International Conference on

Date of Conference:

2002