网络受限移动对象过去、现在及将来位置的索引
文献类型：期刊论文
| 作者 | 丁治明 ; 李肖南 ; 余波 |
| 刊名 | 软件学报
 |
| 出版日期 | 2009 |
| 卷号 | 20期号:12页码:3193-3204 |
| 关键词 | 移动对象 数据库 索引 时空轨迹 movingobject database index spatial-temporaltrajectory moving object database index spatial-temporal trajectory |
| ISSN号 | 1000-9825 |
| 其他题名 | indexing the historical, current, and future locations of network-constrained moving objects |
| 中文摘要 | 提出了一种适合于网络受限移动对象数据库的动态轨迹R树索引结构(network-constrained moving objects dynamic trajectory R-Tree,简称NDTR-Tree).NDTR-Tree不仅能够索引移动对象的整个历史轨迹,而且能够动态地索引和维护移动对象的当前及将来位置.为了比较相关索引结构及算法的性能,进行了详细的实验.实验结果表明,与现有的基于道路网络的移动对象索引方法如MON-Tree和FNR-Tree等相比,NDTR-Tree有效地提高了对网络受限移动对象动态全轨迹的查询处理性能. |
| 收录类别 | ei,cscd,wanfang |
| 语种 | 中文 |
| 公开日期 | 2010-08-19 |
| 附注 | 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. |
| 源URL | [http://124.16.136.157/handle/311060/3364]  |
| 专题 | 软件研究所_基础软件国家工程研究中心_期刊论文 |
| 推荐引用方式 GB/T 7714 | 丁治明,李肖南,余波. 网络受限移动对象过去、现在及将来位置的索引[J]. 软件学报,2009,20(12):3193-3204. |
| APA | 丁治明,李肖南,&余波.(2009).网络受限移动对象过去、现在及将来位置的索引.软件学报,20(12),3193-3204. |
| MLA | 丁治明,et al."网络受限移动对象过去、现在及将来位置的索引".软件学报 20.12(2009):3193-3204. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。