Y.: Reverse Nearest Neighbors in Large Graphs

A reverse nearest neighbor query returns the data objects that have a query point as their nearest neighbor. Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we propose algorithms and optimization techniques for RNN queries by utilizing some characteristics of networks. Introduction-Motivation Given a multi-dimensional dataset P and a point q, a (monochromatic) reverse nearest neighbor (RNN) query retrieves all the points p∈P that have q as their nearest neighbor. Given two datasets P and Q and a point q,