This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aggregate Nearest Neighbor Queries in Road Networks
June 2005 (vol. 17 no. 6)
pp. 820-833
Aggregate nearest neighbor queries return the object that minimizes an aggregate distance function with respect to a set of query points. Consider, for example, several users at specific locations (query points) that want to find the restaurant (data point), which leads to the minimum sum of distances that they have to travel in order to meet. We study the processing of such queries for the case where the position and accessibility of spatial objects are constrained by spatial (e.g., road) networks. We consider alternative aggregate functions and techniques that utilize Euclidean distance bounds, spatial access methods, and/or network distance materialization structures. Our algorithms are experimentally evaluated with synthetic and real data. The results show that their relative performance depends on the problem characteristics.

[1] T. Brinkhoff, “A Framework for Generating Network-Based Moving Objects,” GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[2] E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[3] R. Fagin, A. Lotem, and M. Naor, “Optimal Aggregation Algorithms for Middleware,” Proc. Symp. Principles of Database Systems, 2001.
[4] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[5] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, “Integrated Query Processing Strategies for Spatial Path Queries,” Proc. Int'l Conf. Data Eng., 1997.
[6] I.F. Ilyas, W. Aref, and A. Elmagarmid, “Supporting Top-k Join Queries in Relational Databases,” Proc. Int'l Conf. Very Large Data Bases, 2003.
[7] C.S. Jensen, J. Kolar, T.B. Pedersen, and I. Timko, “Nearest Neighbor Queries in Road Networks,” Proc. ACM Int'l Workshop Geographic Information Systems, 2003.
[8] N. Jing, Y.W. Huang, and E.A. 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, May/June 1998.
[9] S. Jung and S. Pramanik, “An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 5, pp. 1029-1046, Sept./Oct. 2002.
[10] A. Natsev, Y.-C. Chang, J.R. Smith, C.-S. Li, and J.S. Vitter, “Supporting Incremental Join Queries on Ranked Inputs,” Proc. Int'l Conf. Very Large Data Bases, 2001.
[11] D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, “Group Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng., 2004.
[12] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, “Query Processing in Spatial Network Databases,” Proc. Int'l Conf. Very Large Data Bases, 2003.
[13] T. Seidl and H.-P. Kriegel, “Optimal Multi-Step k-Nearest Neighbor Search,” ACM SIGMOD, 1998.
[14] C. Shahabi, M.R. Kolahdouzan, and M. Sharifzadeh, “A Road Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases,” Proc. ACM Int'l Workshop Geographic Information Systems, 2002.
[15] S. Shekhar, A. Kohli, and M. Coyle, “Path Computation Algorithms for Advanced Traveller Information System (ATIS),” Proc. Int'l Conf. Data Eng., 1993.
[16] S. Shekhar and D. Liu, “CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 1, pp. 102-119, Jan./Feb. 1997.
[17] S. Shekhar and J.S. Yoo, “Processing In-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches,” Proc. ACM Int'l Workshop Geographic Information Systems, 2003.
[18] S.H. Woo and S.B. Yang, “An Improved Network Clustering Method for I/O-Efficient Query Processing,” Proc. ACM Int'l Workshop Geographic Information Systems, 2000.
[19] M.L. Yiu and N. Mamoulis, “Clustering Objects on a Spatial Network,” Proc. ACM SIGMOD Conf., 2004.

Index Terms:
Query processing, spatial databases, spatial databases and GIS, location-dependent and sensitive.
Citation:
Man Lung Yiu, Nikos Mamoulis, Dimitris Papadias, "Aggregate Nearest Neighbor Queries in Road Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 820-833, June 2005, doi:10.1109/TKDE.2005.87
Usage of this product signifies your acceptance of the Terms of Use.