%A PAN Qian, ZHANG Yu-ping and CHEN Hai-yan %T Implementation of Parallel K-Nearest Neighbor Join Algorithm Based on CUDA %0 Journal Article %D 2016 %J Computer Science %R 10.11896/j.issn.1002-137X.2016.10.035 %P 190-192 %V 43 %N 10 %U {https://www.jsjkx.com/CN/abstract/article_15683.shtml} %8 2018-12-01 %X In order to solve the problem of K-nearest neighbor join query in large scale spatial data,a parallel optimization method of K-nearest neighbor join algorithm based on CUDA programming model was designed.The parallel process of K-nearest neighbor join algorithm is divided into two stages.One is to establish the R-Tree index for the data set Q and P participate in the query,and the other is to carry out the KNNJ query based on R-Tree index.Firstly,MBR is created according to the location of nodes,and the R-Tree index is created based on SRT by CUDA.Then,the KNNJ query is made based on the R-Tree index,including parallel computing and parallel sorting.The distance between two points can be calculated by each thread on the parallel,and quicksort is executed in parallel on the CUDA.Experimental results show that with the increase of sample size,the advantages of parallel K-nearest neighbor algorithm are more obvious,which has high efficiency and scalability.