Communications of the ACM
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The Information Bus: an architecture for extensible distributed systems
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
Efficient type inclusion tests
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
“Data in your face”: push technology in perspective
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Distributed virtual environments and VRML: an event-based architecture
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Exploiting an event-based infrastructure to develop complex distributed systems
Proceedings of the 20th international conference on Software engineering
Using events for the scalable federation of heterogeneous components
Proceedings of the 8th ACM SIGOPS European workshop on Support for composing distributed applications
Exploiting IP multicast in content-based publish-subscribe systems
IFIP/ACM International Conference on Distributed systems platforms
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Efficient Matching for Web-Based Publish/Subscribe Systems
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
Efficient Query Subscription Processing in a Multicast Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
An Infrastructure for Meta-Auctions
WECWIS '00 Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000)
Engineering Event-Based Systems with Scopes
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Filter Similarities in Content-Based Publish/Subscribe Systems
ARCS '02 Proceedings of the International Conference on Architecture of Computing Systems: Trends in Network and Pervasive Computing
Load Balancing Content-Based Publish/Subscribe Systems
ACM Transactions on Computer Systems (TOCS)
An efficient management of correlation sets with broadcast
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Dynamic load balancing in distributed content-based publish/subscribe
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
A rule-based publish-subscribe message routing system for ubiquitous computing
UCS'06 Proceedings of the Third international conference on Ubiquitous Computing Systems
Filter merging for efficient information dissemination
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
| Hi-index | 0.00 |
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.