Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems

F. Fabret, Hans-Arno Jacobsen, F. Llirbat, J. Pereira, and K. Ross.

In SIGMOD Conference, pages 115-126, May 2001.
Acceptance rate: 15%. Number of submissions: 293.

Abstract

Publish/Subscribe is the paradigm in which users express long-term interests (“subscriptions”) and some agent “publishes” events (e.g., offers). The job of Publish/Subscribe software is to send events to the owners of subscriptions satisfied by those events. For example, a user subscription may consist of an interest in an airplane of a certain type, not to exceed a certain price. A published event may consist of an offer of an airplane with certain properties including price. Each subscription consists of a conjunction of (attribute, comparison operator, value) predicates. A subscription closely resembles a trigger in that it is a long-lived conditional query associated with an action (usually, informing the subscriber). However, it is less general than a trigger so novel data structures and implementations may enable the creation of more scalable, high performance publish/subscribe systems. This paper describes an attempt at the construction of such algorithms and its implementation. Using a combination of data structures, application-specific caching policies, and application-specific query processing our system can handle 600 events per second for a typical workload containing 6 million subscriptions.

Download



Tags: content-based matching


Readers who enjoyed the above work, may also like the following: