基于路网的k最近邻查询算法综述

Survey of k-nearest neighbor query algorithm on road networks

在互联网时代,基于地理位置的服务越来越普遍,k最近邻查询通过与给定位置的距离来检索k个最近的兴趣点(POIs),是一个与之高度相关的查询.与欧式空间相比,基于路网的k最近邻查询的研究更具有现实的意义和价值,同时也面临着更大的挑战,引起了国内外学者的广泛关注.本文将对基于路网的k最近邻查询算法的研究进展进行综述,并展望该问题未来的研究方向和重点.

In this era of the Internet,Location-Based Services are becoming more common,and a k-nearest neighbor query which retrieves k nearest points of interest(POIs)by distance from a given location,is a highly relevant query.Compared with Euclidean space,the research of k-nearest neighbor query on road networks has more practical significance and value,and also faces greater challenges,so it has attracted extensive attention by scholars at home and abroad.This paper reviews the research achievements of the k-nearest neighbor query algorithm on road networks,and looks forward to the future research directions and key points for this problem.