Region Matching Algorithm for DDM Based on Dynamic R-tree

JU Hong-bin · Jisuanji gongcheng · 2008

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.

Read the paper · More papers on PaperTik