数据分发管理匹配算法的R-树实现

数据分发管理（DDM）是高层体系结构（HLA）接口规范的6类服务之一，高效的区域匹配算法是DDM研究的重点和难点．当前的多种匹配算法往往只适用于特定的应用环境，且效率不够理想．R-树法是在空间索引技术的基础上提出的一种新的匹配算法，该方法用R-树对DDM区域的矩形进行组织，并利用Hash索引对其叶结点的组织方式进行了改进．实验结果表明R树法可有效减少动态DDM的维护开销，提高分布交互仿真的实时性,通过调整R-树的相关参数，可以进一步改善匹配算法的性能．

R-tree Method of Matching Algorithm for Data Distribution Management

Data distribution management (DDM) is one of the services defined in the interface specification of high level architecture (HLA). Matching algorithm is the most important problem in the process of DDM implementation. The existing algorithms can only be used in certain condition, and the efficiency is not well enough for large-scale distributed simulations. The R-tree method is a new matching algorithm based on space index technologies. Rectangles of DDM regions are organized as an R-tree in the method, and operations related to matching can be done through the rectangle querying in the R-tree. To improve the efficiency of query, the method also uses a hashing index to point the leaf-node of the R-tree. The performance of the R-tree method is deeply studied in this paper. Experiments show that the R-tree method is better than other matching algorithms. It can efficiently save the cost of matching process of dynamic DDM, and can meet the need of real-time distributed interactive simulations. Changing the entry number of R-tree nodes can further optimize the matching algorithm.