A Whole-time Index Design Based on 3D~+-TPR-tree for Moving Point Targets
Jing Guo · Acta Geodaetica et Cartographica Sinica · 2006
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 rectangle adjustments also gets improved query efficient to some extent.