基于3D^+-TPR-tree的点目标全时段移动索引设计  

A Whole-time Index Design Based on 3D^+-TPR-tree for Moving Point Targets

作　　者：郭晶[1] 刘广军 郭磊 董绪荣[1] 

机构地区：[1]指挥技术学院,北京101416 [2]跟踪与通信技术研究所,北京100094 [3]铁道学院,河北石家庄050043

出　　处：《测绘学报》2006年第3期267-272,共6页Acta Geodaetica et Cartographica Sinica

摘　　要：在经典3D R-tree基础上提出新的3D+R-tree索引,通过改变待索引数据项的结构并重新设计查询处理算法,减少包容矩形死区,提高查询效率;为了满足全时段查询要求,设计一种称为3D+-TPR-tree的联合索引结构,并对其中TPR-tree的参数包容矩形的调整算法进行优化。通过测试,证明3D+R-tree的查询效率明显高于普通3D R-tree;此外,测试结果也表明经过优化的参数包容矩形的调整算法也部分提升了TPR-tree的查询性能。A new index method, named 3D^＋ R-tree, is presented on the basis of classical 3D R-tree. 3D^＋ R-tree tries to improve the query efficiency with specifically designed data structure. This new data structure can effectively overcome the dead-region drawback that 3D R-tree always suffers from. A federated index structure, called 3D^＋- TPR-tree, is designed in the next for the whole-time query demands. We also optimized the adjustment strategy of parameterized bounding rectangle. A specially designed and comprehensive test in the end of this paper show us the remarkably performance improvement of 3D^＋ R-tree comparing to that of 3D R-tree, and TPR-tree with changed bounding reetangle adjustments also gets improved query efficient to some extent.

关 键 词：移动索引 全时段 3D R-TREE 3D^+R-tree TPR-TREE 

分 类 号：P208[天文地球—地图制图学与地理信息工程]