Abstract:
Traditional matching methods of DDM are analyzed and a new region matching method is proposed with spatial index method. Publication regions and subscription regions are organized and managed by constructing a R-tree and matching operation is implemented in the R-tree. The results of simulation experiments show that time cost of R-tree region matching algorithm for DDM is lower by choosing appropriate M parameter. Therefore, it is proved that the algorithm has good performance.
Key words:
R-tree,
Data Distribution Management (DDM),
region matching,
spatial index,
high level architecture
摘要: 分析了传统数据分发管理(DDM)匹配方法,结合空间索引技术的特点,提出了一种动态R-树区域匹配方法,通过建立R-树对公布和订购区域进行组织管理,并在R-树上实现订购区域与公布区域的匹配搜索。仿真实验结果表明,选取适当参数M,可减少动态R-树DDM匹配算法的时间开销,达到较优性能。
关键词:
R-树,
数据分发管理(DDM),
区域匹配,
空间索引,
高层体系结构
CLC Number:
WANG Lei; ZHANG Hui-hui; LI Kai-sheng; JU Hong-bin. Region Matching Algorithm for DDM Based on Dynamic R-tree[J]. Computer Engineering, 2008, 34(3): 56-58.
王 磊;张慧慧;李开生;鞠鸿彬. 基于动态R-树结构的DDM区域匹配算法[J]. 计算机工程, 2008, 34(3): 56-58.