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)
Selectively estimation for Boolean queries
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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)
An active functionality service for e-business applications
ACM SIGMOD Record
Query Merging: Improving Query Subscription Processing in a Multicast Environment
IEEE Transactions on Knowledge and Data Engineering
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient Matching for Web-Based Publish/Subscribe Systems
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
A Genetic Algorithm for Multicast Mapping in Publish-Subscribe Systems
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
A Scalable Protocol for Content-Based Routing in Overlay Networks
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
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
On the Benefits of Non-Canonical Filtering in Publish/Subscribe Systems
ICDCSW '05 Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05) - Volume 04
Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems
Proceedings of the 3rd international Middleware doctoral symposium
Adaptive routing in publish/subscribe systems using hybrid routing algorithms
Proceedings of the 7th workshop on Reflective and adaptive middleware
Self-optimizing Hybrid Routing in Publish/Subscribe Systems
DSOM '09 Proceedings of the 20th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management: Integrated Management of Systems, Services, Processes and People in IT
Flexub: dynamic subscriptions for publish/subscribe systems in MANETs
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
| Hi-index | 0.00 |
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to several filter components. This approach allows for an application of routing algorithms that selectively forward event messages to only a subset of filter components. Beneficial e(r)ects of this scheme include decreasing network and computational load in single filter components.So far, we can find routing optimizations that exploit coverings among subscriptions or utilize subscription merging strategies. Generally, such optimizations aim at reducing the amount of subscriptions forwarded to filter components, which decreases their computational load. This might in turn result in an increasing number of event messages routed through the network.However, current optimization strategies only work on restrictive conjunctive subscriptions and cannot be extended to efficiently support arbitrary subscriptions. Furthermore, it is not possible to apply covering and perfect merging strategies in all application scenarios due to the strong dependency of these approaches on actually registered subscriptions.In this paper, we present a novel optimization approach, subscription generalization, to decrease the filtering overhead in publish/subscribe systems. Our approach is based on selectivities of subscriptions and can be utilized for all kinds of subscriptions including arbitrary Boolean and conjunctive subscriptions. We propose a simple subscription generalization algorithm and show an evaluation of the results of a first series of experiments proving the usefulness of our approach.