A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams
A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams
复制标题
DOI：
10.1109/icdcs.2005.8
复制
发表时间：
2005-06
期刊：
影响因子：
--
通讯作者：
Guoli Li;Shuang Hou;H. Jacobsen
中科院分区：
文献类型：
--
作者：
Guoli Li;Shuang Hou;H. Jacobsen
基于内容的发布/订阅系统所面临的挑战是如何利用有限的系统资源处理大量的动态信息。在当前的p/s系统中，每个订阅都被隔离处理。既不利用各个订阅之间的关系，也不考虑有关订阅和发布的历史信息。我们认为这种忽视限制了整体系统效率。在本文中，我们表示订阅使用修改的二元决策图（MBDs），并设计了一个索引数据结构，以维护不同的谓词和管理相关的布尔变量。我们基于MBD的方法可以以统一的方式解决发布路由和订阅/广告覆盖和合并问题。我们提出了一种新的覆盖算法的基础上MBDs。该算法可以考虑订阅和发布群体的历史信息，并利用订阅之间的关系。我们探讨合并，特别是不完美的合并，并讨论一个基于订阅的优化适用于订阅合并
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 and subscription/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