메뉴 건너뛰기




Volumn 3029, Issue , 2004, Pages 164-169

Incremental maintenance of all-nearest neighbors based on road network

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; ARTIFICIAL INTELLIGENCE; EXPERT SYSTEMS; HEURISTIC METHODS; NEAREST NEIGHBOR SEARCH; TRANSPORTATION;

EID: 9444247019     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24677-0_18     Document Type: Conference Paper
Times cited : (4)

References (6)
  • 1
    • 0032089982 scopus 로고    scopus 로고
    • Incremental distance join algorithms for spatial databases
    • Hjaltason, G.R.: Incremental distance join algorithms for spatial databases, Proc. Of ACM SIGMOD'98 (1998) 237-248
    • (1998) Proc. of ACM SIGMOD'98 , pp. 237-248
    • Hjaltason, G.R.1
  • 2
    • 0021615874 scopus 로고
    • A dynamic index structure for spatial searching
    • Guttman, A.: R-Trees: A dynamic index structure for spatial searching, Proc. of ACM SIGMOD'84 (1984) 47-57
    • (1984) Proc. of ACM SIGMOD'84 , pp. 47-57
    • Guttman, A.1    Trees, R.2
  • 4
    • 84944076278 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • Song, Z.X., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point, Proc. of SSTD'01 (2001) 79-96
    • (2001) Proc. of SSTD'01 , pp. 79-96
    • Song, Z.X.1    Roussopoulos, N.2
  • 5
    • 9444251332 scopus 로고    scopus 로고
    • A fast search method of nearest target object in road networks
    • Feng, J., Watanabe, T.: A Fast Search Method of Nearest Target Object in Road Networks, Journal of the ISCIE, Vol. 16, No. 9 (2003) 484-491
    • (2003) Journal of the ISCIE , vol.16 , Issue.9 , pp. 484-491
    • Feng, J.1    Watanabe, T.2


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