%0 Journal Article
%T Method for multi-way spatial distance join query processing<br>一种多路空间距离连接查询处理方法
%A LIANG Yin
%A ZHANG Hong
%A <br>梁银
%A 张虹
%J 计算机应用
%D 2008
%I 
%X A recursive non-incremental algorithm following a depth-first search was presented for solving multi-way spatial distance join query, which found the K n-tuples for the smallest distance value from n spatial datasets, where each dataset was stored in an R-tree. The user can not have any result until the algorithm ends. The algorithm adopts distance-based plane-sweep technique as optimization technique to effectively reduce disk accesses and CPU response time. Finally, efficiency of the algorithm is validated by experiment.
%K distance-based plane-sweep technique
%K spatial databases
%K multi-way spatial distance join query
%K R-tree<br>多路空间距离连接查询
%K R树
%K 空间数据库
%K 距离平面扫描技术
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=448AB978F3EEDD9E5173D0A206D964BA&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=CA4FD0336C81A37A&sid=7CE3F1F20DE6B307&eid=4C100B7696CE9E24&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=5