K-NEAREST NEIGHBOR QUERY PROCESSING METHODS IN ROAD NETWORK SPACE:PERFORMANCE EVALUATION
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.
road network k-nearest neighbor query static objects
Sung-Hyun Shin Sang-Chul Lee Sang-Wook Kim Junghoon Lee Eul Gyu Lim
Department of Electronics and Computer Engineering, Hanyang University, Korea Computer Science and Statistics, Cheju National University, Korea
国际会议
北京
英文
958-962
2009-11-06（万方平台首次上网日期，不代表论文的发表时间）