• DocumentCode
    3700248
  • Title

    The farthest neighbor queries based on R-trees

  • Author

    Run-Tao Liu;Cheng Chang;Zhi-Qiang Man;Zhong Wang

  • Author_Institution
    Institute of Information and Scientific Computing Technology, Harbin University of Science and Technology
  • Volume
    1
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    235
  • Lastpage
    238
  • Abstract
    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.
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics (ICMLC), 2015 International Conference on
  • Type

    conf

  • DOI
    10.1109/ICMLC.2015.7340928
  • Filename
    7340928
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3700248