메뉴 건너뛰기




Volumn , Issue , 2009, Pages 591-602

Monitoring path nearest neighbor in road networks

Author keywords

Path nearest neighbor; Road networks; Spatial databases

Indexed keywords

K-NEAREST NEIGHBORS; NEAREST NEIGHBOR QUERIES; NEAREST NEIGHBORS; NETWORK DISTANCE; NETWORK EXPANSION; QUERY PATHS; REAL ROAD NETWORKS; ROAD NETWORK; SHORTEST PATH; SPATIAL DATABASE; USER MOVEMENT;

EID: 70849087861     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559907     Document Type: Conference Paper
Times cited : (90)

References (23)
  • 1
    • 33745630711 scopus 로고    scopus 로고
    • An efficient and scalable approach to cnn queries in a road network
    • H.-J. Cho and C.-W. Chung. An efficient and scalable approach to cnn queries in a road network. In Proceedings of VLDB, pages 865-876, 2005.
    • (2005) Proceedings of VLDB , pp. 865-876
    • Cho, H.-J.1    Chung, C.-W.2
  • 3
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Math, 1:269-271, 1959.
    • (1959) Numerische Math , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 4
    • 20744448516 scopus 로고    scopus 로고
    • Computing the shortest path: A* search meets graph theory
    • A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In Proceedings of SODA, pages 156-165, 2005.
    • (2005) Proceedings of SODA , pp. 156-165
    • Goldberg, A.V.1    Harrelson, C.2
  • 6
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G.R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
    • (1999) ACM Trans. Database Syst. , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 8
    • 85117329200 scopus 로고    scopus 로고
    • Voronoi-based k nearest neighbor search for spatial network databases
    • M. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of VLDB, pages 840-851, 2004.
    • (2004) Proceedings of VLDB , pp. 840-851
    • Kolahdouzan, M.1    Shahabi, C.2
  • 10
    • 29844438853 scopus 로고    scopus 로고
    • Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring
    • K. Mouratidis, D. Papadias, and M. Hadjieleftheriou. Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In Proceedings of SIGMOD, pages 634-645, 2005.
    • (2005) Proceedings of SIGMOD , pp. 634-645
    • Mouratidis, K.1    Papadias, D.2    Hadjieleftheriou, M.3
  • 12
    • 0000065529 scopus 로고
    • Finding the shortest route between two points in a network
    • T. A. J. Nicholson. Finding the shortest route between two points in a network. Computer Journal, 9(3):275-280, 1966.
    • (1966) Computer Journal , vol.9 , Issue.3 , pp. 275-280
    • Nicholson, T.A.J.1
  • 13
    • 77950023510 scopus 로고    scopus 로고
    • The v*-diagram: A query-dependent approach to moving knn queries
    • S. Nutanong, R. Zhang, E. Tanin, and L. Kulik. The v*-diagram: a query-dependent approach to moving knn queries. Proc. VLDB Endow., 1(1):1095-1106,2008.
    • (2008) Proc. VLDB Endow , vol.1 , Issue.1 , pp. 1095-1106
    • Nutanong, S.1    Zhang, R.2    Tanin, E.3    Kulik, L.4
  • 16
    • 49049113087 scopus 로고    scopus 로고
    • Monitoring aggregate k-nn objects in road networks
    • L. Qin, J. X. Yu, B. Ding, and Y. Ishikawa. Monitoring aggregate k-nn objects in road networks. In Proceedings of SSDBM, pages 168-186, 2008.
    • (2008) Proceedings of SSDBM , pp. 168-186
    • Qin, L.1    Yu, J.X.2    Ding, B.3    Ishikawa, Y.4
  • 19
    • 0038644058 scopus 로고    scopus 로고
    • A road network embedding technique for k-nearest neighbor search in moving object databases
    • C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. In Proceedings of GIS, pages 94-100, 2002.
    • (2002) Proceedings of GIS , pp. 94-100
    • Shahabi, C.1    Kolahdouzan, M.R.2    Sharifzadeh, M.3
  • 20
    • 19544376329 scopus 로고    scopus 로고
    • Processing in-route nearest neighbor queries: a comparison of alternative approaches
    • S. Shekhar and J. S. Yoo. Processing in-route nearest neighbor queries: a comparison of alternative approaches. In Proceedings of GIS, pages 9-16, 2003.
    • (2003) Proceedings of GIS , pp. 9-16
    • Shekhar, S.1    Yoo, J.S.2
  • 21
  • 23
    • 17844367341 scopus 로고    scopus 로고
    • In-route nearest neighbor queries
    • J. S. Yoo and S. Shekhar. In-route nearest neighbor queries. GeoInformatica, 9(2):117-137, 2005.
    • (2005) GeoInformatica , vol.9 , Issue.2 , pp. 117-137
    • Yoo, J.S.1    Shekhar, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.