Abstract The goal of Nearest Neighbour (NN) search is to find the objects in a dataset A that
are closest to a query point q. Existing algorithms presume that the dataset is indexed by an …

The nearest neighbour problem is of practical significance in a number of fields. Often we
are interested in finding an object near to a given query object. The problem is old, and a …

Nowadays, the need to techniques, approaches, and algorithms to search on data is
increased due to improvements in computer science and increasing amount of information …

Nearest neighbour search (NNS) is an old problem that is of practical importance in a
number of fields. It involves finding, for a given point q, called the query, one or more points …

Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely
used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object …

We present two new neighbor query algorithms, including range query (RNN) and nearest
neighbor (NN) query, based on revised kd tree by using two techniques. The first technique …

Abstract Developed from Nearest Neighbor (NN) queries, Aggregate Nearest Neighbor
(ANN) queries return the object that minimizes an aggregate distance function with respect …

One of the common queries in spatial databases is the (K) Nearest Neighbor Query that
discovers the (K) closest objects to a query object. Processing of spatial queries, in most …

In this paper, we present a fast and versatile algorithm which can rapidly perform a variety of
nearest neighbor searches. Efficiency improvement is achieved by utilizing the distance …

This paper studies a new form of nearest neighbor queries in spatial databases, namely,
mutual nearest neighbor (MNN) search. Given a set D of objects and a query object q, an …