首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于3D+-TPR-tree的点目标全时段移动索引设计
引用本文:郭晶,刘广军,郭磊,董绪荣.基于3D+-TPR-tree的点目标全时段移动索引设计[J].测绘学报,2006,35(3):267-272.
作者姓名:郭晶  刘广军  郭磊  董绪荣
作者单位:指挥技术学院,北京,101416;跟踪与通信技术研究所,北京,100094;铁道学院,河北,石家庄,050043
摘    要:在经典3D R-tree基础上提出新的3D R-tree索引,通过改变待索引数据项的结构并重新设计查询处理算法,减少包容矩形死区,提高查询效率;为了满足全时段查询要求,设计一种称为3D -TPR-tree的联合索引结构,并对其中TPR-tree的参数包容矩形的调整算法进行优化。通过测试,证明3D R-tree的查询效率明显高于普通3D R-tree;此外,测试结果也表明经过优化的参数包容矩形的调整算法也部分提升了TPR-tree的查询性能。

关 键 词:移动索引  全时段  3D  R-tree  3D+R-tree  TPR-tree
文章编号:1001-1595(2006)03-0267-06
收稿时间:04 1 2005 12:00AM
修稿时间:2005-04-012006-02-06

A Whole-time Index Design Based on 3D+-TPR-tree for Moving Point Targets
GUO Jing,LIU Guang-jun,GUO Lei,DONG Xu-rong.A Whole-time Index Design Based on 3D+-TPR-tree for Moving Point Targets[J].Acta Geodaetica et Cartographica Sinica,2006,35(3):267-272.
Authors:GUO Jing  LIU Guang-jun  GUO Lei  DONG Xu-rong
Institution:1. Institute of Command and Technology of Equipment, Beijing 101416, China; 2. Institute of Tracking and Telecommunications Technology, Beijing 100094, China ; 3. Railway Institute, Shijiazhuang 050043, China
Abstract: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.
Keywords:moving index  whole time  3D R-tree  3D~  R-tree  TPR-tree  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号