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

网络受限移动对象过去、现在及将来位置的索引
引用本文:丁治明,李肖南,余 波.网络受限移动对象过去、现在及将来位置的索引[J].软件学报,2009,20(12):3193-3204.
作者姓名:丁治明  李肖南  余 波
作者单位:中国科学院,软件研究所,基础软件国家工程研究中心,北京,100190
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60573164 (国家自然科学基金); the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry (国家教育部留学回国人员科研启动基金)
摘    要:提出了一种适合于网络受限移动对象数据库的动态轨迹R树索引结构(network-constrained moving objects dynamic trajectory R-Tree,简称NDTR-Tree).NDTR-Tree不仅能够索引移动对象的整个历史轨迹,而且能够动态地索引和维护移动对象的当前及将来位置.为了比较相关索引结构及算法的性能,进行了详细的实验.实验结果表明,与现有的基于道路网络的移动对象索引方法如MON-Tree和FNR-Tree等相比,NDTR-Tree有效地提高了对网络受限移动对象动态全轨迹的查询处理性能.

关 键 词:移动对象  数据库  索引  时空轨迹
收稿时间:2007/8/27 0:00:00
修稿时间:2008/5/19 0:00:00

Indexing the Historical, Current, and Future Locations of Network-Constrained Moving Objects
DING Zhi-Ming,LI Xiao-Nan and YU Bo.Indexing the Historical, Current, and Future Locations of Network-Constrained Moving Objects[J].Journal of Software,2009,20(12):3193-3204.
Authors:DING Zhi-Ming  LI Xiao-Nan and YU Bo
Abstract:A new index structure for network constrained moving objects, network-constrained moving objects dynamic trajectory R-Tree (or NDTR-Tree for short), is proposed in this paper. NDTR-Tree can index the whole trajectories of moving objects, including their historical, current, and near future positions. In order to compare the performance of the NDTR-Tree with other index structures for network constrained moving objects, such as MON-Tree and FNR-Tree, a series of experiments have been conducted, and the experimental results show that the NDTR-Tree outperforms the previously proposed network constrained moving objects index methods in dealing with dynamically maintained trajectories of moving objects.
Keywords:moving object  database  index  spatial-temporal trajectory
本文献已被 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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