메뉴 건너뛰기




Volumn , Issue , 2005, Pages 634-645

Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION RETRIEVAL; PROBLEM SOLVING; REAL TIME SYSTEMS;

EID: 29844438853     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066230     Document Type: Conference Paper
Times cited : (281)

References (19)
  • 1
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • [B02]
    • [B02] Brinkhoff, T. A Framework for Generating Network-based Moving Objects. GeoInformatica, (6)2: 153-180, 2002.
    • (2002) GeoInformatica , vol.2 , Issue.6 , pp. 153-180
    • Brinkhoff, T.1
  • 2
    • 84948772383 scopus 로고    scopus 로고
    • Nearest neighbor and reverse nearest neighbor queries for moving objects
    • [BJKS02]
    • [BJKS02] Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects, IDEAS, 2002.
    • (2002) IDEAS
    • Benetis, R.1    Jensen, C.2    Karciauskas, G.3    Saltenis, S.4
  • 3
    • 2342648021 scopus 로고    scopus 로고
    • Processing range-monitoring queries on heterogeneous mobile objects
    • [CHC04]
    • [CHC04] Cai, Y., Hua, K., Cao, G. Processing Range-Monitoring Queries on Heterogeneous Mobile Objects. MDM, 2004.
    • (2004) MDM
    • Cai, Y.1    Hua, K.2    Cao, G.3
  • 5
    • 5444256613 scopus 로고    scopus 로고
    • MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system
    • [GL04]
    • [GL04] Gedik, B., Liu, L. MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System. EDBT, 2004.
    • (2004) EDBT
    • Gedik, B.1    Liu, L.2
  • 6
    • 29844445935 scopus 로고
    • A distance scan algorithm for spatial access structures
    • [H84]
    • [H84] Henrich, A. A Distance Scan Algorithm for Spatial Access Structures. ACM GIS, 1984.
    • (1984) ACM GIS
    • Henrich, A.1
  • 7
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • [HS99]
    • [HS99] Hjaltason, G., Samet, H. Distance Browsing in Spatial Databases. ACM TODS, 24(2): 265-318, 1999.
    • (1999) ACM TODS , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.1    Samet, H.2
  • 8
    • 2442450144 scopus 로고    scopus 로고
    • Reverse nearest neighbor aggregates over data streams
    • [KMS02]
    • [KMS02] Korn, F., Muthukrishnan, S. Srivastava, D. Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB, 2002.
    • (2002) VLDB
    • Korn, F.1    Muthukrishnan, S.2    Srivastava, D.3
  • 9
    • 28444458945 scopus 로고    scopus 로고
    • Approximate NN queries on streams with guaranteed error/performance bounds
    • [KOTZ04]
    • [KOTZ04] Koudas, N., Ooi, B., Tan, K., Zhang, R. Approximate NN queries on Streams with Guaranteed Error/performance Bounds. VLDB, 2004.
    • (2004) VLDB
    • Koudas, N.1    Ooi, B.2    Tan, K.3    Zhang, R.4
  • 10
    • 3142704472 scopus 로고    scopus 로고
    • SINA: Scalable incremental processing of continuous queries in spatio-temporal databases
    • [MXA04]
    • [MXA04] Mokbel, M., Xiong, X., Aref, W. SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. SIGMOD, 2004.
    • (2004) SIGMOD
    • Mokbel, M.1    Xiong, X.2    Aref, W.3
  • 12
    • 0036808476 scopus 로고    scopus 로고
    • Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects
    • [PXK+02]
    • [PXK+02] Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W., Hambrusch, S. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE 0ransactions on Computers, 51(10): 1124-1140, 2002.
    • (2002) IEEE 0ransactions on Computers , vol.51 , Issue.10 , pp. 1124-1140
    • Prabhakar, S.1    Xia, Y.2    Kalashnikov, D.3    Aref, W.4    Hambrusch, S.5
  • 14
    • 0005298186 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • [SR01]
    • [SR01] Song, Z., Roussopoulos, N. K-Nearest Neighbor Search for Moving Query Point. SSTD, 2001.
    • (2001) SSTD
    • Song, Z.1    Roussopoulos, N.2
  • 15
    • 26444614367 scopus 로고    scopus 로고
    • Discovery of influence sets in frequently updated databases
    • [SRAA01]
    • [SRAA01] Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A. Discovery of Influence Sets in Frequently Updated Databases. VLDB, 2001.
    • (2001) VLDB
    • Stanoi, I.1    Riedewald, M.2    Agrawal, D.3    Abbadi, A.4
  • 16
    • 0346329832 scopus 로고    scopus 로고
    • Spatial queries in dynamic environments
    • [TP03]
    • [TP03] Tao, Y., Papadias, D. Spatial Queries in Dynamic Environments. ACM TODS, 28(2): 101-139, 2003.
    • (2003) ACM TODS , vol.28 , Issue.2 , pp. 101-139
    • Tao, Y.1    Papadias, D.2
  • 17
    • 28044449142 scopus 로고    scopus 로고
    • SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases
    • [XMA05]
    • [XMA05] Xiong, X., Mokbel, M., Aref, W. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. ICDE, 2005.
    • (2005) ICDE
    • Xiong, X.1    Mokbel, M.2    Aref, W.3
  • 18
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring K-nearest neighbor queries over moving objects
    • [YPK05]
    • [YPK05] Yu, X. Pu, K., Koudas, N. Monitoring K-Nearest Neighbor Queries Over Moving Objects. ICDE, 2005.
    • (2005) ICDE
    • Yu, X.1    Pu, K.2    Koudas, N.3


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