Algorithms for K-Nearest Neighbor Query on Sphere
Hao Xiao-hongb · Jisuanji gongcheng · 2011
According to the characteristics of the datasets on the sphere,the algorithm of the K-Nearest Neighbor query based on the query axis(PAM) and the algorithm of the K-Nearest Neighbor query based on the query circular planar(PCM) are presented.Theoretical research and experimental results show that both the two methods can handle the problem of the K-Nearest Neighbor query on the sphere,compared with the PCM,PAM has advantages on the memory capacitance and the query efficiency,but the expansibility of PAM is poor and PCM has high scalability.