NBR-tree:面向城市交通网络的一种新型时空索引  

NBR-tree:A Novel Spatio-temporal Index for Urban Traffic Networks

作　　者：金培权[1] 张旭[1] 岳丽华[1] 

机构地区：[1]中国科学技术大学计算机科学与技术学院,合肥市金寨路96号230027

出　　处：《武汉大学学报（信息科学版）》2010年第2期147-151,共5页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目(60776801);国家863计划资助项目(2009AA12Z204);中国科学院专项基金资助项目(KJ2100110005)

摘　　要：以城市交通网络为背景,提出了一种新型的基于受限网络的时空索引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.

关 键 词：移动对象 时空索引 城市交通网络 

分 类 号：P208[天文地球—地图制图学与地理信息工程]