Nearest Neighbor Queries (1995) [360 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Nick Roussopoulos and Stephen Kelley and Frédéric Vincent},
title = {Nearest Neighbor Queries},
booktitle = {},
year = {1995},
pages = {71--79}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
A frequently encountered type of query in Geographic Information Systems is to find the k nearest neighbor objects to a given point in space. Processing such queries requires substantially different search algorithms than those for location or range queries. In this paper we present an efficient branch-and-bound R-tree traversal algorithm to find the nearest neighbor object to a point, and then generalize it to finding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, we present the results of several experiments obtained using the implementation of our algorithm and examine the behavior of the metrics and the scalability of the algorithm. 1 INTRODUCTION The efficient implementation of Nearest Neighbor (NN) queries is of a particular interest in Geographic Information Systems (GIS). For example, a user may point to a specific location or an object on the screen, and request the system to find...
