Optimal location queries in road network databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 804-815

  Xiao, Xiaokui ^a   Yao, Bin ^b   Li, Feifei ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b Florida State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTUAL DISTANCE; COST METRICS; OPTIMAL LOCATIONS; OPTIMAL-LOCATION QUERY; QUERY PROCESSING ALGORITHMS; ROAD NETWORK; SPATIAL LOCATION; SPATIAL QUERIES; UNIFIED FRAMEWORK;

FACILITIES; MOTOR TRANSPORTATION; OPTIMIZATION; ROADS AND STREETS;

LOCATION;

EID: 79957865060     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767845     Document Type: Conference Paper

References (23)

1. D. Zhang, Y. Du, T. Xia, and Y. Tao, "Progressive computation of the min-dist optimal-location query," in VLDB, 2006, pp. 643-654.
2. Y. Du, D. Zhang, and T. Xia, "The optimal-location query," in SSTD, 2005, pp. 163-180.00.
3. S. Cabello, J. M. D́az-B́añez, S. Langerman, C. Seara, and I. Ventura, "Reverse facility location problems," in CCCG, 2005, pp. 68-71.
4. R. C.-W. Wong, T. Özsu, P. S. Yu, A. W.-C. Fu, and L. Liu, "Efficient method for maximizing bichromatic reverse nearest neighbor," PVLDB, vol. 2, no. 1, pp. 1126-1137, 2009.
5. R. Z. Farahani and M. Hekmatfar, Facility Location: Concepts, Models, Algorithms and Case Studies, 1st ed. Physica-Verlag HD, 2009.
6. S. Nickel and J. Puerto, Location Theory: A Unified Approach, 1st ed. Springer, 2005.
7. A. Meyerson, "Online facility location," in FOCS, 2001, pp. 426-431. (Pubitemid 33068403)
8. D. Fotakis, "Incremental algorithms for facility location and k-median," Theor. Comput. Sci., vol. 361, no. 2-3, pp. 275-313, 2006. (Pubitemid 44189109)
9. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query processing in spatial network databases," in VLDB, 2003, pp. 802-813.
10. M. R. Kolahdouzan and C. Shahabi, "Voronoi-based k-nearest neighbor search for spatial network databases," in VLDB, 2004, pp. 840-851.
11. C. S. Jensen, J. Koĺarvr, T. B. Pedersen, and I. Timko, "Nearest neighbor queries in road networks," in GIS, 2003, pp. 1-8. (Pubitemid 40730578)
12. J. Sankaranarayanan, H. Samet, and H. Alborzi, "Path oracles for spatial networks," PVLDB, vol. 2, no. 1, pp. 1210-1221, 2009.
13. J. Sankaranarayanan and H. Samet, "Distance oracles for spatial networks," in ICDE, 2009, pp. 652-663.
14. M. L. Yiu, N. Mamoulis, and D. Papadias, "Aggregate nearest neighbor queries in road networks," TKDE, vol. 17, no. 6, pp. 820-833, 2005. (Pubitemid 40860461)
15. K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis, "Continuous nearest neighbor monitoring in road networks," in VLDB, 2006, pp. 43- 54.
16. H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable network distance browsing in spatial databases," in SIGMOD, 2008, pp. 43-54.
17. Z. Chen, H. T. Shen, X. Zhou, and J. X. Yu, "Monitoring path nearest neighbor in road networks," in SIGMOD, 2009, pp. 591-602.
18. K. Deng, X. Zhou, H. T. Shen, S. Sadiq, and X. Li, "Instance optimal query processing in spatial networks," VLDBJ, vol. 18, no. 3, pp. 675- 693, 2009.
19. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computa- tional Geometry: Algorithms and Applications, 3rd ed. Springer-Verlag, 2008.
20. J. Hershberger, "Finding the upper envelope of n line segments in o(n log n) time," Inf. Process. Lett., vol. 33, no. 4, pp. 169-174, 1989. (Pubitemid 20635847)
21. M. Erwig and F. Hagen, "The graph voronoi diagram with applications," Networks, vol. 36, pp. 156-163, 2000.
22. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
23. S. Shekhar and D.-R. Liu, "CCAM: A connectivity-clustered access method for networks and network computations," TKDE, vol. 9, no. 1, pp. 102-119, 1997. (Pubitemid 127772252)