… , which retrieve the NNs for all points on a line segment, the query input is still … query
type—“range nearest-neighbor”(RNN) queries. Given a d-dimensional data set, an RNN query …

… query type, approximate range nearest neighbor (NN) query, that returns an answer set A such
that each object in A is one of the k nearest object(s) to every point in a given query … query …

… which finds the kNNs of a given query point based on the … nearest neighbor (CONN) search
[6]. As our baseline algorithm is to reduce an RONN to a range query and four CONN queries…

… of running spatial range queries by utilizing only k-Nearest Neighbor (k-NN) queries. … the
rectangular spatial range query by minimizing the number of k-NN queries as possible. Finally, …

… an efficient query processing algorithm for k-range nearest neighbor (kRNN) queries in road
networks. Our algorithm distinguishes itself from the existing solution for the kRNN query, as …

… queries requires substantially different search algorithms than those for location or range
queries… bound R-tree traversal algorithm to find the nearest neighbor object to a point, and then …

… Berchtold proposed a method on Voronoi cells which is built specifically for nearest
neighbor queries [10]. Range queries uses index structures that works based on Branch-and-bound …

… data from the web for a given spatial range query using only k-NN searches. Based on the …
a set of range query algorithms to completely cover the rectangular shape of the query range (…

… We also examine nearest neighbor queries where instead of a time instant, an … query by
reducing it to a combination of range queries and the above simple nearest neighbor queries…

… the distance dmax from the query point q. Next, a range query was executed on site set to
retrieve the final candidates. The range query was: select all sites in the range R from the site …