Event matching in symmetric subscription systems

  • Authors:
  • Walid Rjaibi;Klaus R. Dittrich;Dieter Jaepel

  • Affiliations:
  • IBM Research, Rüschlikon, Switzerland;University of Zürich, Zürich, Switzerland;IBM Research, Rüschlikon, Switzerland

  • Venue:
  • CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Publish/subscribe and database systems researchers have recognized the importance of the event matching algorithm to the performance and scalability of a content-based subscription system. A number of interesting event matching techniques as well as DBMS solutions have been proposed in recent research work in the area. Content-based subscription systems allow information consumers to define filtering criteria when they register their interest in being notified of events that match their requirements. However, information producers are not offered the same flexibility. Moreover, content-based subscription systems require that the value of each attribute in the event schema be known at publication time. Certain types of information producers need to be given the flexibility of selecting what types of information consumers can receive their publications as well as the ability to personalize their publications at individual attribute level. This paper introduces symmetric subscription systems as an extension to content-based subscription systems which address the above issues. The paper also discusses a matching algorithm suitable for this type of publish/subscribe systems.