Given a set of facilities and a set of users, a reverse k nearest neighbors (R k NN) query q
returns every user for which the query facility is one of the k closest facilities. Almost all of the …

Given a set of facilities and a set of users, a reverse k nearest neighbors (RkNN) query q
returns every user for which the query facility is one of the k-closest facilities. Due to its …

In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database
can be used to check whether p is the closest to some query point q. We extend the notion of …

Fast query processing of complex objects, eg spatial or uncertain objects, depends on
efficient spatial pruning of objects' approximations, which are typically minimum bounding …

A reverse nearest neighbour (RNN) query returns every object for which the query is its
nearest neighbour. Recently, a new useful variant of the RNN query has emerged, called …

The widespread use of location-aware services and technologies which retrieve or answer
spatial queries has received much interest in today's society. An increasing number of …

Given a set of facilities and a set of users, a reverse nearest neighbors (RNN) query
retrieves every user for which the query facility is its closest facility. Since is the closest …

In this paper we focus on the problem of continuously monitoring the set of Reverse k-
Nearest Neighbors (R k NNs) of a query object in a moving object database using a client …

A reverse k-nearest neighbor (RkNN) query retrieves the data points which regard the query
point as one of their respective k nearest neighbors. A bi-chromatic reverse k-nearest …

Given a set of users U, a set of facilities F, and a query facility q, a reverse nearest neighbors
(RNN) query retrieves every user u for which q is its closest facility. Since q is the closest …