Efficient Path Finding Based on the algorithm for Processing k-Nearest Neighbor Queries in Road Network Databases |
Shin, Sung-Hyun
(한양대학교 공과대학 컴퓨터공학부)
Lee, Sang-Chul (한양대학교 공과대학 컴퓨터공학부) Kim, Sang-Wook (한양대학교 공과대학 컴퓨터공학부) Lee, Jung-Hoon (제주대학교 전산통계학과) Im, Eul-Kyu (한양대학교 공과대학 컴퓨터공학부) |
1 | Dijkstra, K W., 'A note on two problems in connection with graphs,' Numerische Mathematik, vol.1, pp.269-271, 1959 DOI |
2 | Kolahdouzan, M. and Shahabi, C., 'Voronoi- Based K-Nearest Neighbor Search for Spatial Network Databases,' In Proc. Int'l Conf on Very Large Data Bases, VLDB, pp.840-851, Sept. 2004 |
3 | Wu, S. and Wu, K., 'Effective Location-Based Services with Dynamic Data Management in Mobile Environments,' Wireless Networks, vol.12, no.3, pp.369-381, 2006 DOI ScienceOn |
4 | Papadias, D., Zhang, J. MarnouIis, N., and Tao, Y, 'Query Processing in Spatial Network Databases,' In Proc. Int'l Conf. on Very Large Data Bases, VLDB, pp.802-813, Sept. 2003 |
5 | Lee, S.-C., Kim, S.-W., Lee, J. and Yoo, J. S., 'Approximate Indexing in Road Network Databases,' ACM Int'l Symp. on Applied Computing, ACM SAC, pp.1568-1572, Mar. 2009 DOI |
6 | Faloutsos, C. and Lin, K., 'Fastlap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets,' In Proc. ACM Int'l Conf. on Management of Data, ACM SIGMOD, pp.163-174, May 1995. DOI |
7 | Beckmann, N., Kriegel, H., Schneider, R., and Seeger, B., 'The R-tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. the ACM Int'l Carr[. on Management of Data, ACM SIGMOD, pp.322-331, May 1990 DOI |
8 | Hart, P, E, Nilsson, N. J., and Raphael, B., 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs,' IEEE Trans. on Systems Science and Cybernetics, vol, SSC-4, no. 2, pp.100-107, July 1968. DOI ScienceOn |