메뉴 건너뛰기




Volumn 4443 LNCS, Issue , 2007, Pages 863-869

CircularTrip: An effective algorithm for continuous kNN queries

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; GRID COMPUTING; PROBLEM SOLVING;

EID: 38049123933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71703-4_71     Document Type: Conference Paper
Times cited : (14)

References (10)
  • 1
    • 84944076278 scopus 로고    scopus 로고
    • Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: SSTD. (2001) 79-96
    • Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: SSTD. (2001) 79-96
  • 2
    • 0036373494 scopus 로고    scopus 로고
    • Time-parameterized queries in spatio-temporal databases
    • Tao, Y., Papadias, D.: Time-parameterized queries in spatio-temporal databases. In: SIGMOD Conference. (2002) 334-345
    • (2002) SIGMOD Conference , pp. 334-345
    • Tao, Y.1    Papadias, D.2
  • 3
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB. (2002) 287-298
    • (2002) VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 5
    • 85012111044 scopus 로고    scopus 로고
    • Continuous k-nearest neighbor queries for continuously moving points with updates
    • Iwerks, G.S., Samet, H., Smith, K.P.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: VLDB. (2003) 512-523
    • (2003) VLDB , pp. 512-523
    • Iwerks, G.S.1    Samet, H.2    Smith, K.P.3
  • 6
    • 28044449142 scopus 로고    scopus 로고
    • Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases
    • Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE. (2005) 643-654
    • (2005) ICDE , pp. 643-654
    • Xiong, X.1    Mokbel, M.F.2    Aref, W.G.3
  • 7
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring k-nearest neighbor queries over moving objects
    • Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE. (2005) 631-642
    • (2005) ICDE , pp. 631-642
    • Yu, X.1    Pu, K.Q.2    Koudas, N.3
  • 8
    • 29844431650 scopus 로고    scopus 로고
    • A generic framework for monitoring continuous spatial queries over moving objects
    • Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD. (2005) 479-490
    • (2005) SIGMOD , pp. 479-490
    • Hu, H.1    Xu, J.2    Lee, D.L.3
  • 9
    • 29844438853 scopus 로고    scopus 로고
    • Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring
    • Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: SIGMOD. (2005) 634-645
    • (2005) SIGMOD , pp. 634-645
    • Mouratidis, K.1    Hadjieleftheriou, M.2    Papadias, D.3
  • 10
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • Brinkhoff, T.: A framework for generating network-based moving objects. Geolnformatica 6(2) (2002) 153-180
    • (2002) Geolnformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1


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