2
|
Abstract:
Content-based subscription systems are an emerging alternative to traditional publish-subscribe systems, because they permit more flexible subscriptions along multiple dimensions. In these systems, each subscription is a predicate which may test arbitrary attributes within an event. However, the matching problem for content-based systems--- determining for each event the subset of all subscriptions whose predicates match the event--- is still an open problem. We present an efficient, scalable solution to the matching problem. Our solution has an expected time complexity that is sub-linear in the number of subscriptions, and it has a space complexity that is linear. Specifically, we prove that for predicates reducible to conjunctions of elementary tests, the expected time to match a random event is no greater than O(N
Citations
| 477 | The process group approach to reliable distributed computing – Birman - 1993 |
| 220 | An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems – Banavar, Chandra, et al. - 1999 |
| 172 | The information bus { an architecture for extensible distributed systems – Oki, PFluegl, et al. - 1994 |
| 52 | A Predicate Matching Algorithm for Database Rule Systems – Hanson, Chaabouni, et al. - 1990 |
| 48 | Group communication – Powell - 1996 |
| 34 | Efficient Recognition of Events in a Distributed System – Gough, Smith - 1995 |
| 2 | of a scalable event notification service: Interface and architecture – Design - 1998 |
