loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Data Engineering (ICDE'05)
Tokyo, Japan
April 05-April 08
ISBN: 0-7695-2285-8
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.
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
Usage of this product signifies your acceptance of the Terms of Use.