Nearest-neighbor Query Algorithm Based on Grid Partition of Space-filling Curve
基于空间填充曲线网格划分的最近邻查询算法

As the overlap between minimum bounding rectangles in the directory of R-tree is increasing very rapidly with growing number of the data,the performance of the nearest-neighbor query algorithm based on R-tree deteriorates rapidly.To avoid the problem,the paper presented a nearest-neighbor query algorithm based on grid partition of space-filling curve.Space-filling curve has the properties of dimension reduction and data clustering.Using space-filling curve,the algorithm divides 2D space into equal-size grid...