21st International Conference on Data Engineering (ICDE'05) (2005)
Apr. 5, 2005 to Apr. 8, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.124
Man Lung Yiu , University of Hong Kong
Dimitris Papadias , Hong Kong University of Science and Technology
Nikos Mamoulis , University of Hong Kong
Yufei Tao , City University of Hong Kong
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.
Y. Tao, N. Mamoulis, M. L. Yiu and D. Papadias, "Reverse Nearest Neighbors in Large Graphs," 21st International Conference on Data Engineering (ICDE'05)(ICDE), Tokyo, Japan, 2005, pp. 186-187.