메뉴 건너뛰기




Volumn , Issue , 2010, Pages 189-200

Multi-guarded safe zone: An effective technique to monitor moving circular range queries

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE COMPUTATION; EXPECTED DISTANCE; EXPECTED VALUES; EXPERIMENTAL STUDIES; MOVING RANGE; ORDER OF MAGNITUDE; POSITIVE VALUE; RANGE QUERY; SAFE ZONES; TIME UNITS; UPPER BOUND;

EID: 77952781221     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447864     Document Type: Conference Paper
Times cited : (53)

References (25)
  • 1
    • 2342648021 scopus 로고    scopus 로고
    • Processing range-monitoring queries on heterogeneous mobile objects
    • Y. Cai, K. A. Hua, and G. Cao, "Processing range-monitoring queries on heterogeneous mobile objects," in Mobile Data Management, 2004.
    • (2004) Mobile Data Management
    • Cai, Y.1    Hua, K.A.2    Cao, G.3
  • 2
    • 29844431650 scopus 로고    scopus 로고
    • A generic framework for monitoring continuous spatial queries over moving objects
    • H. Hu, J. Xu, and D. L. Lee, "A generic framework for monitoring continuous spatial queries over moving objects," in SIGMOD Conference, 2005, pp. 479-490.
    • SIGMOD Conference, 2005 , pp. 479-490
    • Hu, H.1    Xu, J.2    Lee, D.L.3
  • 3
    • 29844438853 scopus 로고    scopus 로고
    • Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring
    • K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, "Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring," in SIGMOD, 2005.
    • (2005) SIGMOD
    • Mouratidis, K.1    Hadjieleftheriou, M.2    Papadias, D.3
  • 4
    • 84948772383 scopus 로고    scopus 로고
    • Nearest neighbor and reverse nearest neighbor queries for moving objects
    • R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis, "Nearest neighbor and reverse nearest neighbor queries for moving objects," in IDEAS, 2002, pp. 44-53.
    • (2002) IDEAS , pp. 44-53
    • Benetis, R.1    Jensen, C.S.2    Karciauskas, G.3    Saltenis, S.4
  • 6
    • 35048864790 scopus 로고    scopus 로고
    • Mobieyes: Distributed processing of continuously moving queries on moving objects in a mobile system
    • B. Gedik and L. Liu, "Mobieyes: Distributed processing of continuously moving queries on moving objects in a mobile system," in EDBT, 2004, pp. 67-87.
    • (2004) EDBT , pp. 67-87
    • Gedik, B.1    Liu, L.2
  • 7
    • 0036373494 scopus 로고    scopus 로고
    • Time-parameterized queries in spatio-temporal databases
    • Y. Tao and D. Papadias, "Time-parameterized queries in spatio-temporal databases," in SIGMOD Conference, 2002, pp. 334-345.
    • SIGMOD Conference, 2002 , pp. 334-345
    • Tao, Y.1    Papadias, D.2
  • 8
    • 28244469516 scopus 로고    scopus 로고
    • A threshold-based algorithm for continuous monitoring of k nearest neighbors
    • K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao, "A threshold-based algorithm for continuous monitoring of k nearest neighbors," TKDE, pp. 1451-1464, 2005.
    • (2005) TKDE , pp. 1451-1464
    • Mouratidis, K.1    Papadias, D.2    Bakiras, S.3    Tao, Y.4
  • 9
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Y. Tao, D. Papadias, and Q. Shen, "Continuous nearest neighbor search," in VLDB, 2002, pp. 287-298.
    • (2002) VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 10
    • 28044449142 scopus 로고    scopus 로고
    • Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases
    • X. Xiong, M. F. Mokbel, and W. G. Aref, "Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases," in ICDE, 2005, pp. 643-654.
    • (2005) ICDE , pp. 643-654
    • Xiong, X.1    Mokbel, M.F.2    Aref, W.G.3
  • 11
    • 85012111044 scopus 로고    scopus 로고
    • Continuous k-nearest neighbor queries for continuously moving points with updates
    • G. S. Iwerks, H. Samet, and K. P. Smith, "Continuous k-nearest neighbor queries for continuously moving points with updates," in VLDB, 2003, pp. 512-523.
    • (2003) VLDB , pp. 512-523
    • Iwerks, G.S.1    Samet, H.2    Smith, K.P.3
  • 12
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring k-nearest neighbor queries over moving objects
    • X. Yu, K. Q. Pu, and N. Koudas, "Monitoring k-nearest neighbor queries over moving objects," in ICDE, 2005.
    • (2005) ICDE
    • Yu, X.1    Pu, K.Q.2    Koudas, N.3
  • 13
    • 0036808476 scopus 로고    scopus 로고
    • Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects
    • S. Prabhakar, Y. Xia, D. V. Kalashnikov, W. G. Aref, and S. E. Hambrusch, "Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects," IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, 2002.
    • (2002) IEEE Trans. Computers , vol.51 , Issue.10 , pp. 1124-1140
    • Prabhakar, S.1    Xia, Y.2    Kalashnikov, D.V.3    Aref, W.G.4    Hambrusch, S.E.5
  • 14
    • 3142704472 scopus 로고    scopus 로고
    • Sina: Scalable incremental processing of continuous queries in spatio-temporal databases
    • M. F. Mokbel, X. Xiong, and W. G. Aref, "Sina: Scalable incremental processing of continuous queries in spatio-temporal databases," in SIGMOD Conference, 2004, pp. 623-634.
    • SIGMOD Conference, 2004 , pp. 623-634
    • Mokbel, M.F.1    Xiong, X.2    Aref, W.G.3
  • 15
    • 33745566710 scopus 로고    scopus 로고
    • Continuous expansion: Efficient processing of continuous range monitoring in mobile environments
    • X. Wang and W. Wang, "Continuous expansion: Efficient processing of continuous range monitoring in mobile environments," in DASFAA, 2006, pp. 890-899.
    • (2006) DASFAA , pp. 890-899
    • Wang, X.1    Wang, W.2
  • 16
    • 33749390553 scopus 로고    scopus 로고
    • Distributed continuous range query processing on moving objects
    • H. Wang, R. Zimmermann, and W.-S. Ku, "Distributed continuous range query processing on moving objects," in DEXA, 2006, pp. 655-665.
    • (2006) DEXA , pp. 655-665
    • Wang, H.1    Zimmermann, R.2    Ku, W.-S.3
  • 17
    • 18744400817 scopus 로고    scopus 로고
    • Motion adaptive indexing for moving continual queries over moving objects
    • B. Gedik, K.-L. Wu, P. S. Yu, and L. Liu, "Motion adaptive indexing for moving continual queries over moving objects," in CIKM, 2004.
    • (2004) CIKM
    • Gedik, B.1    Wu, K.-L.2    Yu, P.S.3    Liu, L.4
  • 18
    • 85008034296 scopus 로고    scopus 로고
    • Incremental processing of continual range queries over moving objects
    • K.-L.Wu, S.-K. Chen, and P. S. Yu, "Incremental processing of continual range queries over moving objects," IEEE Trans. Knowl. Data Eng., vol. 18, no. 11, pp. 1560-1575, 2006.
    • (2006) IEEE Trans. Knowl. Data Eng. , vol.18 , Issue.11 , pp. 1560-1575
    • Wu, K.-L.1    Chen, S.-K.2    Yu, P.S.3
  • 19
    • 84944038788 scopus 로고    scopus 로고
    • Semantic caching in location-dependent query processing
    • B. Zheng and D. L. Lee, "Semantic caching in location-dependent query processing," in SSTD, 2001, pp. 97-116.
    • (2001) SSTD , pp. 97-116
    • Zheng, B.1    Lee, D.L.2
  • 20
    • 84944076278 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • Z. Song and N. Roussopoulos, "K-nearest neighbor search for moving query point," in SSTD, 2001, pp. 79-96.
    • (2001) SSTD , pp. 79-96
    • Song, Z.1    Roussopoulos, N.2
  • 21
    • 77950023510 scopus 로고    scopus 로고
    • The v*-diagram: A query-dependent approach to moving knn queries
    • S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "The v*-diagram: a query-dependent approach to moving knn queries," PVLDB, vol. 1, no. 1, pp. 1095-1106, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 1095-1106
    • Nutanong, S.1    Zhang, R.2    Tanin, E.3    Kulik, L.4
  • 22
    • 70350349487 scopus 로고    scopus 로고
    • Efficient construction of safe regions for moving knn queries over dynamic datasets
    • M. Hasan, M. A. Cheema, X. Lin, and Y. Zhang, "Efficient construction of safe regions for moving knn queries over dynamic datasets," in SSTD, 2009, pp. 373-379.
    • (2009) SSTD , pp. 373-379
    • Hasan, M.1    Cheema, M.A.2    Lin, X.3    Zhang, Y.4
  • 23
    • 0021615874 scopus 로고    scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-trees: A dynamic index structure for spatial searching," in SIGMOD Conference, 1984, pp. 47-57.
    • SIGMOD Conference, 1984 , pp. 47-57
    • Guttman, A.1
  • 24
    • 79959555493 scopus 로고    scopus 로고
    • Lazy updates: An efficient technique to continuously monitoring reverse knn
    • M. A. Cheema, X. Lin, Y. Zhang, W. Wang, and W. Zhang, "Lazy updates: An efficient technique to continuously monitoring reverse knn," PVLDB, 2009.
    • (2009) PVLDB
    • Cheema, M.A.1    Lin, X.2    Zhang, Y.3    Wang, W.4    Zhang, W.5
  • 25
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • T. Brinkhoff, "A framework for generating network-based moving objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
    • (2002) GeoInformatica , vol.6 , Issue.2 , pp. 153-180
    • Brinkhoff, T.1


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