Algorithms for Minimum Distances Aggregation Query in Spatial Databases
空间数据库中最小距离聚集查询及其算法

In this paper, a new form of distance query, minimum distances aggregation query, is proposed. This kind of query computes the aggregations of distances from objects of several data sets to objects of a central data set, and return the K minimum distances aggregations. In spatial databases, nearest-neighbor-based method and threshold algorithm are presented for the data sets stored in the R-tree family. A performance study based on extensive experiments shows that threshold algorithm outperforms nearest-neighbor-based method.