Research of Spatial Data Query Optimization Methods Based on K-Nearest Neighbor Algorithm

摘要

According to the problems of multi dimension, mass and complexity of spatial data and the low efficiency of traditional spatial data query optimization algorithm, this paper proposes the improved K-Nearest Neighbor (KNN) query optimization algorithm based on KD-tree spatial index technology. The algorithm accelerates the search of finding the k nearest neighbors in KNN algorithm by constructing a quickly create KD-tree indexes. By comparing the experimental results of different data sets and different k values with the traditional FOR circle query, the feasibility and efficiency of the improved KNN query optimization algorithm are verified.