The arbitrary Boolean publish/subscribe model: making the case
Bittner, S., Hinze, A. (2007). The arbitrary Boolean publish/subscribe model: making the case. In Proceedings of the 2007 inaugural international conference on Distributed event-based systems, 20-22 June, 2007, Toronto, Canada (pp. 226-237). New York, USA: ACM.
Permanent Research Commons link: https://hdl.handle.net/10289/8078
In this paper, we present BoP, a content-based publish/subscribe system for arbitrary Boolean subscriptions and advertisements. BoP targets at the time and space-efficient matching of event messages using the wide-spread attribute-value pair event model. In contrast to other content-based publish/subscribe systems focussing on an efficient matching process, BoP internally supports subscriptions and advertisements as arbitrary Boolean expressions. As we will show in this paper, directly handling these representations leads to efficiency benefits for applications using this class of expressions. The support of arbitrary Boolean subscriptions and advertisements requires the introduction of efficient matching and overlapping calculation algorithms, as well as applicable routing optimizations. In this paper, we will outline these solutions that have been integrated into BoP. The evaluation part of this work presents the results of a comparative study of our approaches and recent conjunctive solutions.