New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Multiattribute hashing using Gray codes
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Multidimensional access methods
ACM Computing Surveys (CSUR)
Scalable molecular-dynamics, visualization, and data-management algorithms for materials simulations
IMPACT of Computing in Science and Engineering
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS
IEEE Transactions on Software Engineering
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and Data Engineering
Filter Similarities in Content-Based Publish/Subscribe Systems
ARCS '02 Proceedings of the International Conference on Architecture of Computing Systems: Trends in Network and Pervasive Computing
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
XNET: A Reliable Content-Based Publish/Subscribe System
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Subscription propagation in highly-available publish/subscribe middleware
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
A random projection approach to subscription covering detection in publish/subscribe systems
COLCOM '07 Proceedings of the 2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing
MICS: an efficient content space representation model for publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
Subscription covering is an optimization that reduces the number of subscriptions propagated, and hence, the size of routing tables, in a content-based publish-subscribe system. However, detecting covering relationships among subscriptions can be a costly computational task; this cost can potentially reduce the utility of covering as an optimization. We introduce an alternate approach called approximate subscription covering, that can provide much of the benefits of subscription covering at a fraction of the cost. By forgoing an exhaustive search for covering subscriptions in favor of an approximate search, it is shown that the time complexity of covering detection can be dramatically reduced. The tradeoff between efficiency of covering detection and the approximation error is demonstrated through the analysis of indexes for multi-attribute subscriptions based on space filling curves.