%0 Journal Article
%T Algorithms for Minimum Distances Aggregation Query in Spatial Databases<br>空间数据库中最小距离聚集查询及其算法
%A LIU Yun-Sheng
%A LIU Xiao-Feng
%A XIAO Yin-Yuan
%A <br>刘云生
%A 刘小峰
%A 肖迎元
%J 计算机科学
%D 2005
%I 
%X 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.
%K Spatial databases
%K Query processing
%K Distance query
%K Distance aggregation<br>空间数据库
%K 查询处理
%K 距离查询
%K 距离聚集
%K R树索引
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=9CA15AD1944063C9&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=9CF7A0430CBB2DFD&sid=6270DC1B5693DDAF&eid=4DB1E72614E68564&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=11