direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications of KBS

Generic Constraints for Content-Based Publish/Subscribe Systems
Citation key Muehl:2001:GenericConstraints
Author Gero Mühl
Title of Book Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS'01)
Pages 211–225
Year 2001
Address Trento, Italy
Volume 2172
Month sep
Editor C. Batini and F. Giunchiglia and P. Giorgini and M. Mecella
Publisher Springer-Verlag
Series LNCS
Abstract Publish/subscribe interaction enables the loosely coupled exchange of asynchronous notifications. Matching notifications to subscriptions and routing notifications from producers to interested consumers are the main problems in large-scale publish/subscribe systems. Content-based selection provides great flexibility because it allows to categorize notifications with respect to multiple dimensions but it also requires complex routing strategies. Previous work has tightly coupled content-based routing and matching algorithms to the constraints that can be used to select notifications of interest. This paper introduces the idea of generic constraints for content-based selection that are separated from the underlying matching and routing algorithms. Therefore, new constraints can be added easily. Moreover, this paper introduces the idea of filter merging that can improve the scalability of a notification service. Finally, we present novel algorithms for matching, covering, and merging.
Link to publication [1] Download Bibtex entry [2]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008