摘要
针对基础数据集合和参考数据集合为相同数据集的情况,给出了一种新型的空间数据库全局最近邻查询算法,该算法能够利用数据最近邻结果的自身特点,避免较大的查询过程中的资源开销。实验结果表明,算法的效率要明显优于常用最近邻查询算法,并且对于不同的数据维数和数据元素数量,特别是对于高维的空间数据集合,算法具有较高的稳定性。
To the special circumstance of basic data set equal to reference data set,this paper gives a new type of spatial database queries the global nearest neighbor algorithm that take advantage of the results of its nearest neighbor data characteristics.This algorithm could avoid the larger process of inquiry the resource overhead.Experimental results show that the algorithm is significantly better than the commonly used nearest neighbor search algorithm.And then,for different data dimensions and the number of data elements,especially for high dimensional space data set,this paper algorithm has higher stability.
出处
《电脑编程技巧与维护》
2011年第20期75-76,共2页
Computer Programming Skills & Maintenance
关键词
空间数据库
空间查询处理算法
全局最近邻查询
扫描线算法
Spatial database
spatial query processing methods
all-nearest-neighbour query
plane sweeping algorithm
