Author(s)

Chong Xu, Xin Liu, Wei Wang, Yong Shi, Ning Tao

Corresponding Author

Chong Xu

Abstract

spatial database refers to the sum of the geospatial data related to application stored by GIS on computer physical storage medium. Due to the low efficiency of the traditional query method and the single query information, it is an important aspect of spatial data query research that how to excavate information with specific meaning quickly and effectively in huge data. In order to more deeply excavate the information of the spatial database, the spatial data query conducted uses range queries, K-nearest neighbor algorithm queries, optimization of anti-nearest neighbor query algorithms, and realization of a large number of classified spatial data queries. The results obtained by using the inverse nearest neighbor query algorithm are that in all sets belonging to a class of points, a certain position is used as a collection of points from its nearest location, and the algorithm is verified by data experiments. The feasibility of the optimal query is achieved.

Keywords

Spatial database, K nearest neighbor algorithm, Anti-nearest neighbor query algorithm