Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves

We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduces the number of subscriptions propagated, and hence the size of routing tables in a contentbased publish-subscribe system. However, detecting covering relationships among subscriptions can be an expensive computational task that potentially reduces the utility of covering as an optimization. We introduce an alternate approach approximate subscription covering, which provide much of the benefits of subscription covering at a fraction of its 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 trade off between efficiency of covering detection and the approximation error is demonstrated through the analysis of indexes for multi-attribute subscriptions based on space fill...

• Type: Conference
• Year: 2007
• Where: ICDCS
• Authors: Zhenhui Shen, Srikanta Tirthapura
• Keywords: Contentbased Publish-subscribe System, Distributed And Parallel Computing, ICDCS 2007, Subscription Covering, Subscriptions