Issue No.04 - April (2006 vol.18)
pp: 540-553
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). 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 provide a fundamental lemma, which can be used to prune the search space while traversing the graph in search for RNN. Based on it, we develop two RNN methods; an eager algorithm that attempts to prune network nodes as soon as they are visited and a lazy technique that prunes the search space when a data point is discovered. We study retrieval of an arbitrary number k of reverse nearest neighbors, investigate the benefits of materialization, cover several query types, and deal with cases where the queries and the data objects reside on nodes or edges of the graph. The proposed techniques are evaluated in various practical scenarios involving spatial maps, computer networks, and the DBLP coauthorship graph.
Query processing, spatial databases, graphs and networks.
Dimitris Papadias, Nikos Mamoulis, Man Lung Yiu, "Reverse Nearest Neighbors in Large Graphs", IEEE Transactions on Knowledge & Data Engineering, vol.18, no. 4, pp. 540-553, April 2006, doi:10.1109/TKDE.2006.67