Computational geometry: an introduction
Computational geometry: an introduction
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
Exploiting IP multicast in content-based publish-subscribe systems
IFIP/ACM International Conference on Distributed systems platforms
Theory of answering queries using views
ACM SIGMOD Record
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Replicated condition monitoring
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A modular approach to build structured event-based systems
Proceedings of the 2002 ACM symposium on Applied computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Exactly-once Semantics in a Replicated Messaging System
Proceedings of the 17th International Conference on Data Engineering
Generic Constraints for Content-Based Publish/Subscribe
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Answering Queries by Semantic Caches
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
A predicate-based caching scheme for client-server database architectures
The VLDB Journal — The International Journal on Very Large Data Bases
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)
Attribute-based filtering for embedded systems
Proceedings of the 2nd international workshop on Distributed event-based systems
The Knowledge Engineering Review
Content-Based Routing with On-Demand Multicast
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Subscription propagation in highly-available publish/subscribe middleware
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Event Handling for the Universal Enterprise
Information Technology and Management
Dynamic group communication in mobile peer-to-peer environments
Proceedings of the 2005 ACM symposium on Applied computing
Data management research at Technische Universität Darmstadt
ACM SIGMOD Record
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Proceedings of the second international conference on Distributed event-based systems
Fast track article: Dynamic filter merging and mergeability detection for publish/subscribe
Pervasive and Mobile Computing
Towards a lightweight content-based publish/subscribe services for peer-to-peer systems
International Journal of Grid and Utility Computing
Impact of complex filters on the message throughput of the activeMQ JMS server
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
eCube: hypercube event for efficient filtering in content-based routing
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
p2pWeb: An open, decentralized infrastructure of Web servers for sharing ephemeral Web content
Computer Networks: The International Journal of Computer and Telecommunications Networking
Interactive definition of single-user profiles for alerting systems
Proceedings of the 22nd Conference of the Computer-Human Interaction Special Interest Group of Australia on Computer-Human Interaction
Unified semantics for event correlation over time and space in hybrid network environments
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Building a configurable publish/subscribe notification service
DAIS'05 Proceedings of the 5th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
MoCoA: customisable middleware for context-aware mobile applications
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Matching notifications to subscriptions and routing notifications from producers to interested consumers are the main problems in large-scale publish/subscribe systems.Most previously proposed distributed notification services either use flooding or, if filtering is performed, they assume that each event broker has global knowledge about all active subscriptions. Both approaches degrade the scalability of notification services as the former wastes network resources and the latter generates overly large routing tables.In this paper we describe content-based routing algorithms that exploit filter similarities in order to reduce the size of routing tables and the number of control messages that are exchanged among the brokers in order to keep the routing tables up-to-date. In particular, the proposed algorithms do not assume global knowledge about all active subscriptions. Furthermore, we describe how these optimizations can be supported if the underlying data and filter model is based on structured records.