中文摘要：

提出了一种适合于网络受限移动对象数据库的动态轨迹R树索引结构（network-constrained moving objects dynamic trajectory R-Tree,简称NDTR-Tree）.NDTR-Tree不仅能够索引移动对象的整个历史轨迹,而且能够动态地索引和维护移动对象的当前及将来位置.为了比较相关索引结构及算法的性能,进行了详细的实验.实验结果表明,与现有的基于道路网络的移动对象索引方法如MON-Tree和FNR-Tree等相比,NDTR-Tree有效地提高了对网络受限移动对象动态全轨迹的查询处理性能.

英文摘要：

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.