메뉴 건너뛰기




Volumn 9, Issue 4, 2005, Pages 321-341

Alternative solutions for continuous K nearest neighbor queries in spatial network databases

Author keywords

Continuous nearest neighbor queries; Spatial network databases

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; QUERY LANGUAGES;

EID: 28044458115     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10707-005-4575-8     Document Type: Article
Times cited : (74)

References (17)
  • 1
    • 33846554510 scopus 로고    scopus 로고
    • A Fast Method for Continuous Nearest Target Objects Query on Road Network
    • Korea Sept
    • J. Feng and T. Watanabe. A Fast Method for Continuous Nearest Target Objects Query on Road Network. VSMM'02, Korea, pp. 182-191, Sept. 2002.
    • (2002) VSMM'02 , pp. 182-191
    • Feng, J.1    Watanabe, T.2
  • 2
    • 0000701994 scopus 로고    scopus 로고
    • "Distance browsing in spatial databases"
    • 10.1145/320248.320255
    • G.R. Hjaltason and H. Samet. "Distance browsing in spatial databases" TODS, Vol. 24(2):265-318, 1999. 10.1145/320248.320255
    • (1999) TODS , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 3
    • 85012111044 scopus 로고    scopus 로고
    • Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates
    • VLDB Berlin, Germany
    • G.S. Iwerks, H. Samet, and K. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. VLDB, Berlin, Germany, pp. 512-523, 2003.
    • (2003) , pp. 512-523
    • Iwerks, G.S.1    Samet, H.2    Smith, K.3
  • 4
    • 28044442278 scopus 로고    scopus 로고
    • Torben Bach Pedersen, and Igor Timko. Nearest Neighbor Queries in Road Networks
    • ACM-GIS03, New Orleans, LA, USA
    • C.S. Jensen, J. Kolrvr, Torben Bach Pedersen, and Igor Timko. Nearest Neighbor Queries in Road Networks. ACM-GIS03, New Orleans, LA, USA, 2003.
    • (2003)
    • Jensen, C.S.1    Kolrvr, J.2
  • 5
    • 23944439504 scopus 로고    scopus 로고
    • Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
    • VLDB, Toronto, Canada
    • M. Kolahdouzan and C. Shahabi. Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. VLDB, Toronto, Canada, 2004.
    • (2004)
    • Kolahdouzan, M.1    Shahabi, C.2
  • 6
    • 0003134982 scopus 로고    scopus 로고
    • Fast Nearest Neighbor Search in Medical Image Databases
    • VLDB, Mumbai (Bombay), India
    • F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast Nearest Neighbor Search in Medical Image Databases. VLDB, Mumbai (Bombay), India, 1996.
    • (1996)
    • Korn, F.1    Sidiropoulos, N.2    Faloutsos, C.3    Siegel, E.4    Protopapas, Z.5
  • 7
    • 28044465416 scopus 로고    scopus 로고
    • Continuous K-Nearest Neighbor Search for Moving Objects
    • SSDBM, Santorini Island, Greece
    • Y. Li, J. Yang, and J. Han. Continuous K-Nearest Neighbor Search for Moving Objects. SSDBM, Santorini Island, Greece, 2004.
    • (2004)
    • Li, Y.1    Yang, J.2    Han, J.3
  • 9
    • 5444219818 scopus 로고    scopus 로고
    • Query Processing in Spatial Network Databases
    • VLDB, Berlin, Germany
    • D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query Processing in Spatial Network Databases. VLDB, Berlin, Germany, 2003.
    • (2003)
    • Papadias, D.1    Zhang, J.2    Mamoulis, N.3    Tao, Y.4
  • 10
    • 0005061919 scopus 로고
    • Nearest Neighbor Queries
    • SIGMOD, San Jose, CA
    • N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. SIGMOD, San Jose, CA, 1995.
    • (1995)
    • Roussopoulos, N.1    Kelley, S.2    Vincent, F.3
  • 11
    • 28044441578 scopus 로고    scopus 로고
    • Optimal Multi-Step k-Nearest Neighbor Search
    • SIGMOD, Seattle, WA, USA
    • T. Seidl and H.-P. Kriegel. Optimal Multi-Step k-Nearest Neighbor Search. SIGMOD, Seattle, WA, USA, 1998.
    • (1998)
    • Seidl, T.1    Kriegel, H.-P.2
  • 12
    • 17844376020 scopus 로고    scopus 로고
    • Processing in-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches
    • ACM-GIS03, New Orleans, LA, USA
    • S. Shekhar and J.S. Yoo. Processing in-Route Nearest Neighbor Queries: A Comparison of Alternative Approaches. ACM-GIS03, New Orleans, LA, USA, 2003.
    • (2003)
    • Shekhar, S.1    Yoo, J.S.2
  • 13
    • 28044458547 scopus 로고    scopus 로고
    • Modeling and Querying Moving Objects
    • IEEE ICDE
    • P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and Querying Moving Objects. IEEE ICDE, 1997.
    • (1997)
    • Sistla, P.1    Wolfson, O.2    Chamberlain, S.3    Dao, S.4
  • 14
    • 0005298186 scopus 로고    scopus 로고
    • K-Nearest Neighbor Search for Moving Query Point
    • SSTD, Redondo Beach, CA, USA
    • Z. Song and N. Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. SSTD, Redondo Beach, CA, USA, 2001.
    • (2001)
    • Song, Z.1    Roussopoulos, N.2
  • 15
    • 0036373494 scopus 로고    scopus 로고
    • Time Parameterized Queries in Spatio-Temporal Databases
    • SIGMOD
    • Y. Tao and D. Papadias. Time Parameterized Queries in Spatio-Temporal Databases. SIGMOD, 2002.
    • (2002)
    • Tao, Y.1    Papadias, D.2
  • 16
    • 28044441355 scopus 로고    scopus 로고
    • Continuous Nearest Neighbor Search
    • VLDB, Hong Kong, China
    • Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. VLDB, Hong Kong, China, 2002.
    • (2002)
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 17
    • 28044449142 scopus 로고    scopus 로고
    • SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
    • ICDE, Tokyo, Japan
    • X. Xiong, M.F. Mokbel, and W.G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. ICDE, Tokyo, Japan, 2005.
    • (2005)
    • Xiong, X.1    Mokbel, M.F.2    Aref, W.G.3


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