【作者】 许建秋； 秦小麟；

【机构】 南京航空航天大学信息学院；

【摘要】 <正>1引言距离计算是交通网中移动对象查询的重要部分,很多常见查询都是基于交通网距离的查询,如最近邻居、最短路径等。最近邻居查询包括CNN更多还原

【Abstract】 To support various services in road networks,e.g.querying nearest neighbors,searching the shortest path,it presents more challenges to moving objects in network database.However,distance in road networks is the length of the shortest path between the two positions in the network.Thus,the Euclidean distance can not approximate the real distance.In this paper,we focus on this problem and propose a novel kind of storage architecture NWN,Node With Neighbors,and its corresponding algorithm NWNDist which can efficiently support for distance calculation in road networks.And R-tree is utilized to index the entry in NWN to improve searching efficiency.The experimental results show that with our approach not only the number of disk accesses during querying is reduced, but also the time cost is decreasing significantly,especially when the number of query points is over two hundreds.更多还原