Abstract

As an important aspect of the near neighbor query in the spatial database, the simple continues near neighbor chain query (SCNNC query) of the datasets has great significance in the practical application. To handle the SCNNC query effectively, the query algorithm based on the constant dataset (the SCNNC_R_ST algorithm), the query algorithm based on the decrement dataset (SCNNC_R_SD algorithm) and the SCNNC_R_XZ algorithm used to deal with the increased dataset were proposed by means of the R-tree and its varieties. Furthermore, the performance of the methods were analyzed and compared by experiment. The theatrical study and the experimental results show that the query efficiency of the SCNNC_R_SD algorithm is superior to SCNNC_R_ST algorithm when the scale of the data set S and the simple continues near neighbor L is large. The SCNNC_R_XZ algorithm has obvious advantages compared with the common method demanding the recalculation each time.

Paper Details