Improving Reverse k Nearest Neighbors Queries
Abstract
The reverse k nearest neighbor query finds all points that have the query point as one of their k nearest neighbors, where the kNN query finds the k closest points to its query point. Based on conics, we propose an efficent RkNN verification method. By using the proposed verification method, we implement an efficient RkNN algorithm on VoR-tree, which has a computational complexity of O(k1.5· log\,k). The comparative experiments are conducted between our algorithm and other two state-of-the-art RkNN algorithms. The experimental results indicate that the efficiency of our algorithm is significantly higher than its competitors.
0