G-ToPSS: fast filtering of graph-based metadata
WWW '05 Proceedings of the 14th international conference on World Wide Web
Efficient constraint processing for location-aware computing
Proceedings of the 6th international conference on Mobile data management
Effects of routing computations in content-based routing networks with mobile data sources
Proceedings of the 11th annual international conference on Mobile computing and networking
Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems
Proceedings of the 3rd international Middleware doctoral symposium
Modelling performance optimizations for content-based publish/subscribe
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
The arbitrary Boolean publish/subscribe model: making the case
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Dynamic content-based channels: meeting in the middle
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
Adaptive content-based routing in general overlay topologies
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Subscription subsumption evaluation for content-based publish/subscribe systems
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Composite subscriptions in content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Covering-Based Routing Algorithms for Cyclic Content-Based P/S System
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
MICS: an efficient content space representation model for publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Parallel event processing for content-based publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Soft state in publish/subscribe
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Efficient and scalable filtering of graph-based metadata
Web Semantics: Science, Services and Agents on the World Wide Web
Proceedings of the 7th international conference on Autonomic computing
Predictive publish/subscribe matching
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Extending mobility to publish/subscribe systems using a pro-active caching approach
Mobile Information Systems
Extending mobility to publish/subscribe systems using a pro-active caching approach
Mobile Information Systems
GPX-matcher: a generic boolean predicate-based XPath expression matcher
Proceedings of the 14th International Conference on Extending Database Technology
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Towards highly parallel event processing through reconfigurable hardware
Proceedings of the Seventh International Workshop on Data Management on New Hardware
Parametric subscriptions for content-based publish/subscribe networks
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
A survey of structured P2P systems for RDF data storage and retrieval
Transactions on large-scale data- and knowledge-centered systems III
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
Optimizing pub/sub systems by advertisement pruning
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
The subscription-cover based routing algorithm in content-based publish/subscribe
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Composite subscriptions in content-based publish/subscribe systems
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Pub/Sub on stream: a multi-core based message broker with QoS support
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Thrifty privacy: efficient support for privacy-preserving publish/subscribe
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing
Content-based publish/subscribe using distributed R-trees
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Language expressiveness and quality of service for publish/subscribe systems
Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference
Parametric Content-Based Publish/Subscribe
ACM Transactions on Computer Systems (TOCS)
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The challenge faced by content-based publish/subscribe systems is the ability to handle a vast amount of dynamic information with limited system resources. In current p/s systems, each subscription is processed in isolation. Neither relationships among individual subscriptions are exploited, nor historic information about subscriptions and publications is taken into account. We believe that this neglect limits overall system efficiency. In this paper, we represent subscriptions using modified binary decision diagrams (MBDs), and design an index data structure to maintain distinct predicates and manage associated Boolean variables. Our MBD-based approach can address, in a unified way, publication routing andsubscription/advertisement covering and merging. We propose a novel covering algorithm based on MBDs. The algorithm can take historic information about subscription and publication populations into account and exploits relations between subscriptions.We explore merging, especially imperfect merging, and discuss an advertisement-based optimization applicable to subscription merging.