中文摘要：

以城市交通网络为背景，提出了一种新型的基于受限网络的时空索引NBR—tree。NBR—tree针对城市交通网络中移动对象特有的运动方向、进入模式等特点，改进了目前流行的MON—tree索引。给出了NBR-tree的索引结构、操作算法以及实验分析。实验表明，NBR-tree可以有效地支持对象移动过程中的最近邻查询，并且具有比MON—tree更好的轨迹查询性能。

英文摘要：

We present a novel spatio-temporal index for constraint networks, which is called NBR-tree （network-based R-tree）. We focus on the background of the applications in urban traffic networks. The NBR-tree is an improvement on the previous index named MON-tree, with an analysis on the specific properties of the moving objects in urban traffic networks. We discuss the index structure, operating algorithms as well as the experiments of the NBR- tree in detail. The experimental results show that our proposed index is able to support NN queries, and is more efficient than the MON-tree in evaluating trajectory queries.