Method for multi-way spatial distance join query processing
一种多路空间距离连接查询处理方法

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.