空间数据库中最小距离聚集查询及其算法  

Algorithms for Minimum Distances Aggregation Query in Spatial Databases

作　　者：刘云生[1] 刘小峰[1] 肖迎元[1] 

机构地区：[1]华中科技大学计算机学院,武汉430074

出　　处：《计算机科学》2005年第9期108-110,122,共4页Computer Science

基　　金：国防预研基金(413150403)

摘　　要：提出了一种新的距离查询形式一最小距离聚集查询,这种查询计算几个对象集中对象到一个中心对象集中对象的距离和,并返回最小的K个距离和。在空间数据库中,对基于R树索引的数据集给出了基于最近邻居的方法和阈值算法来回答查询。通过大量实验对两种算法进行了比较,结果显示阈值算法具有较好的性能。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.

关 键 词：空间数据库 查询处理 距离查询 距离聚集 R树索引 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]