k-Nearest neighbor query processing methods in road network space: Performance evaluation

Citations

SCOPUS

1

초록

The road network now opens a new application area for the classic k-NN queries, which retrieve k objects closest to a given query point. There are many previous methods for k-NN query processing. However, all of them are not sufficient in experimental evaluation of performance. In this paper, we present the way that extensively evaluates prior methods for processing of k-NN queries. To achieve this goal, we first describe well-known previous methods for retrieving k objects closest to a given query point. Next, we establish the criteria against which previous methods have been evaluated for k-NN query processing. Last, we build the experiment environment using the real network data and then perform extensive performance evaluation.

키워드

k-nearest neighbor queryRoad networkStatic objectsExperimental evaluationK-nearest-neighbor queriesK-NN queryNew applicationsPerformance evaluationProcessing methodQuery pointsReal networksRoad networkStatic objectsIndexing (of information)ProcessingQuery processingRoads and streetsMotor transportation
제목
k-Nearest neighbor query processing methods in road network space: Performance evaluation
저자
Shin, Sung-HyunLee, Sang-ChulKim, Sang-WookLee, JunghoonLim, Eul Gyu
DOI
10.1109/ICNIDC.2009.5360949
발행일
2009-11
유형
Conference Paper
저널명
Proceedings of 2009 IEEE International Conference on Network Infrastructure and Digital Content, IEEE IC-NIDC2009
페이지
958 ~ 962