direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

KBS Publikationen

Generic Constraints for Content-Based Publish/Subscribe Systems
Zitatschlüssel Muehl:2001:GenericConstraints
Autor Gero Mühl
Buchtitel Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS'01)
Seiten 211–225
Jahr 2001
Adresse Trento, Italy
Jahrgang 2172
Monat sep
Herausgeber C. Batini and F. Giunchiglia and P. Giorgini and M. Mecella
Verlag Springer-Verlag
Serie LNCS
Zusammenfassung 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 zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe