一种有效的时空连接算法  

Efficient algorithm of spatio-temporal join

作　　者：邹永贵[1] 徐海波[1] 梁新发[1] 杨富平[1] 

机构地区：[1]重庆邮电大学中韩合作GIS研究所,重庆400065

出　　处：《计算机应用研究》2010年第5期1690-1693,1696,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(40801214)

摘　　要：对空间数据库中静态数据集与动态数据集的连接问题进行了研究,提出了一种时空连接算法。该算法使用广度优先顺序对R-tree和TPR-tree进行同步遍历,在连接计算时,使用一种收紧MBR的剪枝策略对TPR-tree的节点进行剪枝,直到两棵树的叶子节点,最后计算R-tree每个叶子节点的最近邻。通过实验表明,算法有效解决了为静态数据集中的所有对象在动态数据集中查找到某个未来时间的最近邻的问题。This paper dealt with the join of the spatial datesets and the spatio-temporal datasets in spatial database,and proposed a novel spatio-temporal join algorithm. The algorithm scaned the R-tree and the TPR-tree involved in spatial join in breadth-first order.When traversing down trees during a join operation,used a pruning approach to tighten MBR to prune the node in TPR-tree , until two trees’ leaf node. Finally, the algorithm calculated nearest neighbor for each leaf node of the R-tree.The experiment results show that the algorithm effectively resolve the problem about searching the nearest neighbor for each object of the spatial datasets in the spatio-temporal datasets in some future time.

关 键 词：空间数据库 空间连接 时空连接 R-TREE TPR-TREE 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]