【摘要】 在分析典型索引结构和树型结构匹配算法变更特性、匹配效率的基础上,以匹配效率高的匹配树算法为基础,扩展其订阅结构为向量结构,提出了向量变更算法。基于向量间的关联关系,提出了向量共享算法,从而有效降低订阅变更对匹配树重构的影响,提高了订阅处理效率。理论分析和实验表明,与已有订阅变更方式相比,该方法能够在满足频繁订阅变更的同时提供高效的事件匹配,满足相关应用的要求。更多还原

【Abstract】 The concept of vector subscriptions to support subscription adaptations was introduced. Novel algorithms were proposed for updating vector subscriptions in classic matching tree structures, and was presented sharing algorithms for vector subscriptions. These algorithms effectively reduce the impact of subscription changes in matching tree structures. Compared to re-subscriptions method, the algorithms significantly reduce the reaction time to subscription updates and can sustain higher throughput in the presence of high update rates.更多还原