메뉴 건너뛰기




Volumn , Issue , 2002, Pages 94-100

A road network embedding technique for K-Nearest Neighbor search in moving object databases

Author keywords

Chessboard Metric; K Nearest Neighbors; Moving Objects; Road Networks; Space Embedding

Indexed keywords

COMPUTATIONAL METHODS; GEOGRAPHIC INFORMATION SYSTEMS; QUERY LANGUAGES; REAL TIME SYSTEMS;

EID: 0038644058     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/585147.585167     Document Type: Conference Paper
Times cited : (85)

References (8)
  • 8
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the distance: An efficient method to KNN processing
    • C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to KNN processing. In The VLDB Journal, pages 421-430, 2001.
    • (2001) The VLDB Journal , pp. 421-430
    • Yu, C.1    Ooi, B.C.2    Tan, K.-L.3    Jagadish, H.V.4


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