Reverse nearest neighbors in large graphs

IEEE Transactions on Knowledge and Data Engineering

Volumn 18, Issue 4, 2006, Pages 540-553

  Yiu, Man Lung ^a   Papadias, Dimitris ^b   Mamoulis, Nikos ^a   Tao, Yufei ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Graphs and networks; Query processing; Spatial databases

Indexed keywords

GRAPHS AND NETWORKS; QUERY PROCESSING; SPATIAL DATABASES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; DATABASE SYSTEMS; QUERY LANGUAGES;

GRAPH THEORY;

EID: 33644644150     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2006.1599391     Document Type: Article

References (21)

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.