The farthest neighbor queries based on R-trees

There are many queries in spatial databases have been discussed. However the farthest neighbor queries, to find the farthest neighbors to a given query point in space, have not been studied. In this paper, we present an efficient branch-and-bound R-tree traversal algorithm to find the farthest neighbor objects to the query point, and it is easy to be generalized to find the k farthest neighbors. We also discuss a searching strategy for pruning. Finally, we performed an experimental test to prove the effectiveness of the proposed algorithm.