Computational geometry: an introduction
Computational geometry: an introduction
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)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Semi-Probabilistic Content-Based Publish-Subscribe
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
MICS: an efficient content space representation model for publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Scalable delivery of stream query result
Proceedings of the VLDB Endowment
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
| Hi-index | 0.00 |
In this paper we address the problem of subsumption checking for subscriptions in pub/sub systems. We develop a novel approach based on negative space representation for subsumption checking and provide efficient algorithms for subscription forwarding in a dynamic pub/sub environment. We then provide heuristics for approximate subsumption checking that greatly enhance the performance without compromising the correct execution of the system and only adding incremental cost in terms of extra computation in brokers. We illustrate the advantages of this novel approach by carrying out extensive experimentation.