RACED: an adaptive middleware for complex event detection
Proceedings of the 8th International Workshop on Adaptive and Reflective MIddleware
Cordies: expressive event correlation in distributed systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Redefinable events for dynamic reconfiguration of communications in ubiquitous computing
Proceedings of the First International Workshop on Data Dissemination for Large Scale Complex Critical Infrastructures
JTangCSPS: A composite and semantic publish/subscribe system over structured P2P networks
Engineering Applications of Artificial Intelligence
Semantic-Based matching and personalization in FWEB, a publish/subscribe-based web infrastructure
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Automatic hyperlink creation using p2p and publish/subscribe
WM'05 Proceedings of the Third Biennial conference on Professional Knowledge Management
Composite subscriptions in content-based publish/subscribe systems
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Semantic interoperability for an autonomic knowledge delivery service
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
| Hi-index | 0.00 |
Content-based publish/subscribe systems mediate between publishers of information and subscribers who sign up to receive information, by routing messages across the network from their source of publication to the point of subscription using the message content. The routing information is derived from the subscriptions. One particular problem faced by content-based publish/subscribe systems is how to turn the speci拢cation of complex subscriptions into routing information that can be distributed across the network.In this paper, we describe a new declarative language for specifying composite events based on the typed ë -calculus. Composite events are represented in this language by cur-riedfunctional expressions, i.e., functions that can be called with less arguments than parameters and which return as a result an updated version of the function with the remaining parameters. Events which are components of the composite event are passed as arguments to such expressions, and the resulting evaluation produces a functional expression which represents the current state of the composite event. A property of this language, derived from a property of the ë -calculus, is that results can be converted back to the expressions from which they were produced. We exploit this property to show how an expression representing a compositeevent can be converted into an expression from which routing information can be derived.