高维空间范围查询并行算法研究

摘要

This paper utilized the parallel technique to present the spatial range query parallel algorithm in high-dimensional space. The algorithm transformed d dimensional spatial range query to the linear space on d slave node processors. The d slave node processors could execute spatial range query at the same time. The master node processor only needed calculate the union of d results which d slave node processors return. The experimental results indicated that its performance was better than that of spatial range query algorithms based on brute - force method, R-tree, VA-file and NB - tree.%采用并行技术提出一种高维空间范围查询并行算法,该算法将d维空间范围查询转换成d个从节点机上的一维空间范围查询,d个从节点机可以并行执行查询操作,主节点机只需要求得d个从节点机返回结果的交集,因此大大减少了查询时间.实验结果表明在高维空间中算法的查询效率优于上述算法.