A fast filtering engine for publish/subscribe system.
Published: 2004
Language: eng
Number of pages: 121
Description: The current trend in the distributed systems is moving away from tightly-coupled systems towards systems of loosely-coupled, dynamically bound components. Due to the demands of modern applications, the popularity of Content-based  publish/subscribe systems is rapidly increasing. However, one of the principal challenges faced by the publish/subscribe research community is to design an efficient matching algorithm for a flexible subscription language. To date, matching algorithms developed for publish/subscribe systems sacrifice subscription language expressiveness for matching performance. For example, almost all state-of-the-art matching algorithms can only support conjunctive subscriptions and many allow only equality predicates. In this thesis, we develop and evaluate a new matching algorithm that can handle any free form expression over a number of predicates. We also propose two extensions to our basic algorithm that can give additional performance benefits at the cost of a slightly restrictive subscription language. Our performance results demonstrate that the algorithm can achieve substantial event processing rates for very large number of subscriptions processed in the system.
Notes: Adviser: Hans-Arno Jacobsen.

Thesis (M.Sc.)--University of Toronto, 2004.

Electronic version licensed for access by U. of T. users.

Source: Masters Abstracts International, Volume: 42-06, page: 2233.

MICR copy on microfiche.