This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reverse Nearest Neighbors in Large Graphs
April 2006 (vol. 18 no. 4)
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.

[1] R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis, “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,” Proc. Int'l Database Eng. and Applications Symp., 2002.
[2] E. Chan and N. Zhang, “Finding Shortest Paths in Large Network Systems,” Proc. Ninth ACM Int'l Symp. Advances in Geographic Information Systems, 2001.
[3] E. Chavez, G. Navarro, R. Baeza-Yates, and J. Marroquin, “Searching in Metric Spaces,” ACM Computing Surveys, vol. 33, no. 3, pp. 273-321, 2001.
[4] E. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numeriche Mathematik, vol. 1, pp. 269-271, 1959.
[5] C. Jensen, J. Kolar, T. Pedersen, and I. Timko, “Nearest Neighbor Queries in Road Networks,” Proc. 11th ACM Int'l Symp. Advances in Geographic Information Systems, 2003.
[6] N. Jing, Y. Huang, and E. Rundensteiner, “Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 3, pp. 409-432, 1998.
[7] S. Jung and S. Pramanik, “HiTi Graph Model of Topographical Roadmaps in Navigation Systems,” Proc. Int'l Conf. Data Eng., 1996.
[8] M. Kolahdouzan and C. Shahabi, “Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases,” Proc. 30th Int'l Conf. Very Large Data Bases, 2004.
[9] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. SIGMOD, 2000.
[10] F. Korn, S. Muthukrishnan, and D. Srivastava, “Reverse Nearest Neighbor Aggregates Over Data Streams,” Proc. 28th Int'l Conf. Very Large Data Bases, 2002.
[11] M. Nascimento, J. Sander, and J. Pound, “Analysis of Sigmod's Co-Authorship Graph,” SIGMOD Record, vol. 32, no. 3, pp. 8-10, 2003.
[12] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query Processing in Spatial Network Databases,” Proc. 28th Int'l Conf. Very Large Data Bases, 2003.
[13] I. Stanoi, D. Agrawal, and A. Abbadi, “Reverse Nearest Neighbor Queries for Dynamic Databases,” Proc. SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, 2000.
[14] A. Singh, H. Ferhatosmanoglu, and A. Tosun, “High Dimensional Reverse Nearest Neighbor Queries,” Proc. Conf. Information and Knowledge Management (CIKM), 2003.
[15] S. Shekhar, A. Kohli, and M. Coyle, “Path Computation Algorithms for Advanced Traveler Information System,” Proc. Int'l Conf. Data Eng., 1993.
[16] S. Shekhar and J. Yoo, “Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches,” Proc. 11th ACM Int'l Symp. Advances in Geographic Information Systems, 2003.
[17] I. Stanoi, M. Riedewald, D. Agrawal, and A. Abbadi, “Discovery of Influence Sets in Frequently Updated Databases,” Proc. 28th Int'l Conf. Very Large Data Bases, 2001.
[18] Y. Tao, D. Papadias, and X. Lian, “Reverse kNN Search in Arbitrary Dimensionality,” Proc. 30th Int'l Conf. Very Large Data Bases, 2004.
[19] C. Traina, A. Traina, B. Seeger, and C. Faloutsos, “Slim-Trees: High Performance Metric Trees Minimizing Overlap between Nodes,” Proc. Seventh Int'l Conf. Extending Database Technology, 2000.
[20] C. Yang and K. Lin, “An Index Structure for Efficient Reverse Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng., 2001.
[21] M. Yiu and N. Mamoulis, “Clustering Objects on a Spatial Network,” Proc. SIGMOD, 2004.

Index Terms:
Query processing, spatial databases, graphs and networks.
Citation:
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Yufei Tao, "Reverse Nearest Neighbors in Large Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 4, pp. 540-553, April 2006, doi:10.1109/TKDE.2006.67
Usage of this product signifies your acceptance of the Terms of Use.