메뉴 건너뛰기




Volumn 26, Issue 1, 2007, Pages 69-79

Search on transportation networks for location-based service

Author keywords

Continuous nearest neighbor search; Location based service; Path search; Transportation network modeling

Indexed keywords

INFORMATION ANALYSIS; INTEGRATION; QUERY LANGUAGES; TRACKING (POSITION);

EID: 33846507238     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-006-0004-4     Document Type: Article
Times cited : (4)

References (29)
  • 2
    • 0033829509 scopus 로고    scopus 로고
    • Gis and transportation : Status and challenges
    • Goodchild MF (2000) Gis and transportation : status and challenges. Geolnformatica 4(2):127-139
    • (2000) Geolnformatica , vol.4 , Issue.2 , pp. 127-139
    • Goodchild, M.F.1
  • 3
    • 0036929998 scopus 로고    scopus 로고
    • Modeling costs of turns in route planning
    • Winter S (2002) Modeling costs of turns in route planning. Geo Informatica (4):345-361
    • (2002) Geo Informatica , vol.4 , pp. 345-361
    • Winter, S.1
  • 4
  • 5
    • 84882536619 scopus 로고
    • An algorithm for path connectivity and its applications
    • Lee CY (1961) An algorithm for path connectivity and its applications. IRE Trans. Electron Comput 10(3):346-365
    • (1961) IRE Trans. Electron Comput , vol.10 , Issue.3 , pp. 346-365
    • Lee, C.Y.1
  • 8
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170-231
    • (1998) ACM Comput Surv , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Gunther, O.2
  • 13
    • 9444247019 scopus 로고    scopus 로고
    • Incremental maintenance of all-nearest neighbors based on road network
    • Proceedings of the IEA/AIE
    • Feng J, Mukai N, Watanabe T (2004) Incremental maintenance of all-nearest neighbors based on road network. In: Proceedings of the IEA/AIE 2004, LNAI, vol 3029, pp 164-169
    • (2004) LNAI , vol.3029 , pp. 164-169
    • Feng, J.1    Mukai, N.2    Watanabe, T.3
  • 14
    • 0141794311 scopus 로고    scopus 로고
    • A road network embedding technique for k-nearest neighbor search in moving object databases
    • Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica (3):255-273
    • (2003) GeoInformatica , vol.3 , pp. 255-273
    • Shahabi, C.1    Kolahdouzan, M.R.2    Sharifzadeh, M.3
  • 15
    • 19544376329 scopus 로고    scopus 로고
    • Processing in-route nearest neighbor queries: A comparison of alternative approaches
    • Shekhar S, Yoo JS (2003) Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: Proceedings of the OIS'03, pp 9-16
    • (2003) Proceedings of the OIS'03 , pp. 9-16
    • Shekhar, S.1    Yoo, J.S.2
  • 17
    • 5444228992 scopus 로고    scopus 로고
    • Li Y, Yang J, Han J (2004) Continuous k-nearest neighbor search for moving objects. SSDBM, pp 123-126
    • Li Y, Yang J, Han J (2004) Continuous k-nearest neighbor search for moving objects. SSDBM, pp 123-126
  • 18
    • 33846554510 scopus 로고    scopus 로고
    • A fast method for continuous nearest target objects query on road network
    • Feng J, Watanabe T (2002) A fast method for continuous nearest target objects query on road network. In: Proceedings of the VSMM'02, pp 182-191
    • (2002) Proceedings of the VSMM'02 , pp. 182-191
    • Feng, J.1    Watanabe, T.2
  • 19
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD'84, pp 47-57
    • (1984) Proceedings of the ACM SIGMOD'84 , pp. 47-57
    • Guttman, A.1
  • 20
    • 0012478906 scopus 로고
    • An introduction to spatial database systems
    • Guting R (1994) An introduction to spatial database systems. Very Large Database] 3(4):357-399
    • (1994) Very Large Database] , vol.3 , Issue.4 , pp. 357-399
    • Guting, R.1
  • 24
    • 0002842113 scopus 로고
    • Hubert r-tree: An improved r-tree using fractals
    • Kamel I, Faloutsos C (1994) Hubert r-tree: an improved r-tree using fractals. In: Proceedings of the 20th VLDB, pp 500-509
    • (1994) Proceedings of the 20th VLDB , pp. 500-509
    • Kamel, I.1    Faloutsos, C.2
  • 25
    • 0031162081 scopus 로고    scopus 로고
    • The sr-tree: An index structure for high-dimensional nearest neighbor queries
    • Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM SIGMOD'97, pp 369-380
    • (1997) Proceedings of the ACM SIGMOD'97 , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 27
    • 33846499339 scopus 로고    scopus 로고
    • Ahn HK, Mamoulis N, Wong HM. A survey on multidimensional access methods
    • Ahn HK, Mamoulis N, Wong HM. A survey on multidimensional access methods.
  • 28
    • 0015489880 scopus 로고
    • Organization and maintenance of large ordered indexes
    • Bayer R, McCreight E (1972) Organization and maintenance of large ordered indexes. Acta Informatica 1(3):173-189
    • (1972) Acta Informatica , vol.1 , Issue.3 , pp. 173-189
    • Bayer, R.1    McCreight, E.2
  • 29
    • 33846478471 scopus 로고    scopus 로고
    • http://www.gsi.go.jp/MAP/CD ROM/2500/t2500.htm


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