基于网络Voronoi图的道路网络连续k近邻查询

Continuous k nearest neighbor queries in road network based on network Voronoi diagrams

道路网络中的连续查询是查找在一条路径上满足查询条件的对象。它是空间网络数据库中的一种重要查询类型。现提出了道路网络中基于k阶Voronoi图的连续k近邻查询方法,该查询方法用分枝限界的思想动态地创建局部Voronoi图,降低了查询代价。

A continuous search in a road network retrieves the objects which satisfy a query condition at any point on a path. It is important query type in the spatial network database. This paper presents an efficient method to process continuous k nearest neighbor in road network based on k Voronoi diagrams. This method dynamically constructs partial Voronoi diagrams using the conception of branch and bound, and reduces the cost of the query.