Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Intelligent Computer and Applications》 2019-04
Add to Favorite Get Latest Update

Survey of k-nearest neighbor query algorithm on road networks

CHEN Xiaodi;FENG Cheng;College of Information and Computer Engineering,Northeast Forestry University;  
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.
【Fund】: 国家级大学生创新创业项目(201710225131)
【CateGory Index】: TP311.13;O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved