Expressiveness and language choice
Data & Knowledge Engineering
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient filtering in publish-subscribe systems using binary decision diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Query Merging: Improving Query Subscription Processing in a Multicast Environment
IEEE Transactions on Knowledge and Data Engineering
Event Systems: How to Have Your Cake and Eat It Too
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Predicate Matching and Subscription Matching in Publish/Subscribe Systems
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A Scalable Protocol for Content-Based Routing in Overlay Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Selection conditions in main memory
ACM Transactions on Database Systems (TODS)
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An open meteorological alerting system: issues and solutions
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Summary-based routing for content-based event distribution networks
ACM SIGCOMM Computer Communication Review
Expressive and Efficient Peer-to-Peer Queries
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Dimension-Based Subscription Pruning for Publish/Subscribe Systems
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
A detailed investigation of memory requirements for publish/subscribe filtering algorithms
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
SBM'06 Proceedings of the Third Eurographics conference on Sketch-Based Interfaces and Modeling
MICS: an efficient content space representation model for publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Efficiently evaluating complex boolean expressions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
StreamHub: a massively parallel architecture for high-performance content-based publish/subscribe
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
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.