作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (3): 56-58. doi: 10.3969/j.issn.1000-3428.2008.03.020

• 软件技术与数据库 • 上一篇    下一篇

基于动态R-树结构的DDM区域匹配算法

王 磊1,张慧慧1,李开生2,鞠鸿彬2   

  1. (1. 北京工业大学机电学院,北京 100022;2. 中国船舶工业集团公司,北京 100036)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-02-05 发布日期:2008-02-05

Region Matching Algorithm for DDM Based on Dynamic R-tree

WANG Lei1, ZHANG Hui-hui1, LI Kai-sheng2, JU Hong-bin2   

  1. (1. College of Mechanical Engineering and Applied Electronics Technology, Beijing University of Technology, Beijing 100022; 2. China State Shipbuilding Corporation, Beijing 100036)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-05 Published:2008-02-05

摘要: 分析了传统数据分发管理(DDM)匹配方法,结合空间索引技术的特点,提出了一种动态R-树区域匹配方法,通过建立R-树对公布和订购区域进行组织管理,并在R-树上实现订购区域与公布区域的匹配搜索。仿真实验结果表明,选取适当参数M,可减少动态R-树DDM匹配算法的时间开销,达到较优性能。

关键词: R-树, 数据分发管理(DDM), 区域匹配, 空间索引, 高层体系结构

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

中图分类号: