| Abstract |
|
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.
|
 Additional Information
|
Citation:
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Yufei Tao,
"Reverse Nearest Neighbors in Large Graphs,"
icde,
pp. 186-187,
21st International Conference on Data Engineering (ICDE'05),
2005
|
