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 neigh...

Full description

Saved in:
Bibliographic Details
Published in2015 International Conference on Machine Learning and Cybernetics (ICMLC) Vol. 1; pp. 235 - 238
Main Authors Liu, Run-Tao, Chang, Cheng, Man, Zhi-Qiang, Wang, Zhong
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2015
Subjects
Charge coupled devices
Farthest neighbor query
Pruning
R-tree
Spatial database
Online AccessGet full text
DOI10.1109/ICMLC.2015.7340928

Cover

More Information
Summary: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.
DOI:10.1109/ICMLC.2015.7340928