메뉴 건너뛰기




Volumn , Issue , 2005, Pages 643-654

SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS QUERIES; K-NEAREST NEIGHBOR QUERIES;

EID: 28044449142     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.128     Document Type: Conference Paper
Times cited : (271)

References (32)
  • 1
    • 84948772383 scopus 로고    scopus 로고
    • Nearest neighbor and reverse nearest neighbor queries for moving objects
    • Rimantas Benetis, Christian S. Jensen, Gytis Karciauskas, and Simonas Saltenis. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In IDEAS, 2002.
    • (2002) IDEAS
    • Benetis, R.1    Jensen, C.S.2    Karciauskas, G.3    Saltenis, S.4
  • 3
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • Thomas Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2), 2002.
    • (2002) GeoInformatica , vol.6 , Issue.2
    • Brinkhoff, T.1
  • 4
    • 2342648021 scopus 로고    scopus 로고
    • Processing range-monitoring queries on heterogeneous mobile objects
    • Ying Cai, Kien A. Hua, and Guohong Cao. Processing Range-Monitoring Queries on Heterogeneous Mobile Objects. In Mobile Data Management, MDM, 2004.
    • (2004) Mobile Data Management, MDM
    • Cai, Y.1    Hua, K.A.2    Cao, G.3
  • 5
    • 0042418190 scopus 로고    scopus 로고
    • Streaming queries over streaming data
    • Sirish Chandrasekaran and Michael J. Franklin. Streaming Queries over Streaming Data. In VLDB, 2002.
    • (2002) VLDB
    • Chandrasekaran, S.1    Franklin, M.J.2
  • 6
    • 0041513203 scopus 로고    scopus 로고
    • Psoup: A system for streaming queries over streaming data
    • Sirish Chandrasekaran and Michael J. Franklin. Psoup: a system for streaming queries over streaming data. VLDB Journal, 12(2): 140-156, 2003.
    • (2003) VLDB Journal , vol.12 , Issue.2 , pp. 140-156
    • Chandrasekaran, S.1    Franklin, M.J.2
  • 7
    • 0040377588 scopus 로고    scopus 로고
    • NiagaraCQ: A scalable continuous query system for internet databases
    • Jianjun Chen, David J. DeWitt, Feng Tian, and Yuan Wang. NiagaraCQ: A Scalable Continuous Query System for Internet Databases. In SIGMOD, 2000.
    • (2000) SIGMOD
    • Chen, J.1    DeWitt, D.J.2    Tian, F.3    Wang, Y.4
  • 9
    • 0021615874 scopus 로고
    • R-Trees: A dynamic index structure for spatial searching
    • Antonin Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD, 1984.
    • (1984) SIGMOD
    • Guttman, A.1
  • 11
    • 85012111044 scopus 로고    scopus 로고
    • Continuous K-nearest neighbor queries for continuously moving points with updates
    • Glenn S. Iwerks, Hanan Samet, and Kenneth P. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In VLDB, 2003.
    • (2003) VLDB
    • Iwerks, G.S.1    Samet, H.2    Smith, K.P.3
  • 12
    • 33745271621 scopus 로고    scopus 로고
    • Maintenance of spatial semijoin queries on moving points
    • Glenn S. Iwerks, Hanan Samet, and Kenneth P. Smith. Maintenance of Spatial Semijoin Queries on Moving Points. In VLDB, 2004.
    • (2004) VLDB
    • Iwerks, G.S.1    Samet, H.2    Smith, K.P.3
  • 13
    • 84983469675 scopus 로고    scopus 로고
    • Query and update efficient B+-tree based indexing of moving objects
    • Christian S. Jensen, Dan Lin, and Beng Chin Ooi. Query and Update Efficient B+-Tree Based Indexing of Moving Objects. In VLDB, 2004.
    • (2004) VLDB
    • Jensen, C.S.1    Lin, D.2    Beng Chin Ooi3
  • 14
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An index structure for high-dimensional nearest neighbor queries
    • Norio Katayama and Shinichi Satoh. The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In SIGMOD, 1997.
    • (1997) SIGMOD
    • Katayama, N.1    Satoh, S.2
  • 15
    • 84948448303 scopus 로고    scopus 로고
    • Indexing the current positions of moving objects using the lazy update R-tree
    • Dongseop Kwon, Sangjun Lee, and Sukho Lee. Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In Mobile Data Management, MDM, 2002.
    • (2002) Mobile Data Management, MDM
    • Kwon, D.1    Lee, S.2    Lee, S.3
  • 17
    • 85012191028 scopus 로고    scopus 로고
    • Supporting frequent updates in R-trees: A bottom-up approach
    • Mong-Li Lee, Wynne Hsu, Christian S. Jensen, and Keng Lik Teo. Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In VLDB, 2003.
    • (2003) VLDB
    • Lee, M.-L.1    Hsu, W.2    Jensen, C.S.3    Keng Lik Teo4
  • 19
    • 3142704472 scopus 로고    scopus 로고
    • SINA: Scalable incremental processing of continuous queries in spatio-temporal databases
    • Mohamed F. Mokbel, Xiaopeng Xiong, and Walid G. Aref. SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In SIGMOD, 2004.
    • (2004) SIGMOD
    • Mokbel, M.F.1    Xiong, X.2    Aref, W.G.3
  • 20
    • 0002092134 scopus 로고    scopus 로고
    • Performance of nearest neighbor queries in R-trees
    • Apostolos Papadopoulos and Yannis Manolopoulos. Performance of Nearest Neighbor Queries in R-Trees. In ICDT, 1997.
    • (1997) ICDT
    • Papadopoulos, A.1    Manolopoulos, Y.2
  • 21
    • 0030157411 scopus 로고    scopus 로고
    • Partition based spatial-merge join
    • Jignesh M. Patel and David J. DeWitt. Partition Based Spatial-Merge Join. In SIGMOD, 1996.
    • (1996) SIGMOD
    • Patel, J.M.1    DeWitt, D.J.2
  • 22
    • 0036808476 scopus 로고    scopus 로고
    • Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects
    • Sunil Prabhakar, Yuni Xia, Dmitri V. Kalashnikov, Walid G. Aref, and Susanne E. Hambrusch. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Trans. on Computers, 51(10), 2002.
    • (2002) IEEE Trans. on Computers , vol.51 , Issue.10
    • Prabhakar, S.1    Xia, Y.2    Kalashnikov, D.V.3    Aref, W.G.4    Hambrusch, S.E.5
  • 25
    • 0036203292 scopus 로고    scopus 로고
    • Indexing of moving objects for location-based services
    • Simonas Saltenis and Christian S. Jensen. Indexing of Moving Objects for Location-Based Services. In ICDE, 2002.
    • (2002) ICDE
    • Saltenis, S.1    Jensen, C.S.2
  • 29
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Yufei Tao, Dimitris Papadias, and Qiongmao Shen. Continuous Nearest Neighbor Search. In VLDB, 2002.
    • (2002) VLDB
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 30
    • 85009167046 scopus 로고    scopus 로고
    • The TPR*Tree: An optimized spatio-temporal access method for predictive queries
    • Yufei Tao, Dimitris Papadias, and Jimeng Sun. The TPR*Tree: An Optimized Spatio-temporal Access Method for Predictive Queries. In VLDB, 2003.
    • (2003) VLDB
    • Tao, Y.1    Papadias, D.2    Sun, J.3
  • 31
    • 28444451609 scopus 로고    scopus 로고
    • Gorder: An efficient method for KNN join processing
    • Chenyi Xia, Hongjun Lu, Beng Chin Ooi, and Jin Hu. Gorder: An Efficient Method for KNN Join Processing. In VLDB, 2004.
    • (2004) VLDB
    • Xia, C.1    Lu, H.2    Beng Chin Ooi3    Hu, J.4


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