We propose a k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point.

In this paper, we propose a k -NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point. We ...

A k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point and two different methods to ...

K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial ob- jects closest to some given query points. Most previous.

K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query points.

This paper applies the Regular Polygon based Search Algorithm (RPSA) to effectively addressing these problems. This algorithm requests a series of k-NN queries ...

Abstract We propose a k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point.

Efficient k nearest neighbor queries on remote spatial databases using range estimation · Computer Science. Proceedings 14th International Conference on… · 2002.

“Efficient k-nearest neighbor queries on remote spatial databases using range estimation”, In: Proceedings of SSDBM., p. 121–130. [16] Bae WD, Alkobaisi, S ...

Our algorithms guarantee the complete coverage of any given spatial query range. The efficiencies of the algorithms are measured by statistical analysis and ...