메뉴 건너뛰기




Volumn , Issue , 2009, Pages 25-32

From trajectories to activities: A spatio-temporal join approach

Author keywords

Spatial databases; Spatial join; Trajectories

Indexed keywords

ACTIVITY SEQUENCE; DAILY ACTIVITY; EMPIRICAL STUDIES; MOVEMENT BEHAVIOR; ROAD NETWORK; SEMANTIC INFORMATION; SPATIAL DATABASE; SPATIAL JOIN; SPATIO-TEMPORAL; SYNTHETIC DATASETS; TRAJECTORY DATA;

EID: 74049083696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1629890.1629897     Document Type: Conference Paper
Times cited : (57)

References (24)
  • 1
    • 77952725798 scopus 로고    scopus 로고
    • A model for enriching trajectories with semantic geographical information
    • ACM New York, NY, USA
    • L. Alvares, V. Bogorny, B. Kuijpers, J. de Macedo, B. Moelans, and A. Vaisman. A model for enriching trajectories with semantic geographical information. In ACM GIS. ACM New York, NY, USA, 2007.
    • (2007) ACM GIS
    • Alvares, L.1    Bogorny, V.2    Kuijpers, B.3    de Macedo, J.4    Moelans, B.5    Vaisman, A.6
  • 3
    • 0027621672 scopus 로고
    • Efficient processing of spatial joins using R-trees
    • ACM New York, NY, USA
    • T. Brinkhoff, H. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In SIGMOD, pages 237-246. ACM New York, NY, USA, 1993.
    • (1993) SIGMOD , pp. 237-246
    • Brinkhoff, T.1    Kriegel, H.2    Seeger, B.3
  • 4
    • 34547303670 scopus 로고    scopus 로고
    • Mining frequent spatio-temporal sequential patterns
    • H. Cao, N. Mamoulis, and D. Cheung. Mining frequent spatio-temporal sequential patterns. In ICDM, page 8, 2005.
    • (2005) ICDM , pp. 8
    • Cao, H.1    Mamoulis, N.2    Cheung, D.3
  • 5
    • 0033872455 scopus 로고    scopus 로고
    • Data redundancy and duplicate detection in spatial join processing
    • J. Dittrich and B. Seeger. Data redundancy and duplicate detection in spatial join processing. In ICDE, pages 535-546, 2000.
    • (2000) ICDE , pp. 535-546
    • Dittrich, J.1    Seeger, B.2
  • 6
    • 36849001879 scopus 로고    scopus 로고
    • Trajectory pattern mining
    • ACM Press New York, NY, USA
    • F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. Trajectory pattern mining. In SIGKDD, pages 330-339. ACM Press New York, NY, USA, 2007.
    • (2007) SIGKDD , pp. 330-339
    • Giannotti, F.1    Nanni, M.2    Pinelli, F.3    Pedreschi, D.4
  • 7
    • 0027261939 scopus 로고
    • Efficient computation of spatial joins
    • O. Gunther and F. Ulm. Efficient computation of spatial joins. In ICDE, pages 50-59, 1993.
    • (1993) ICDE , pp. 50-59
    • Gunther, O.1    Ulm, F.2
  • 8
    • 84994130833 scopus 로고    scopus 로고
    • Spatial joins using R-trees: Breadth-first traversal with global optimizations
    • IEEE
    • Y. Huang, N. Jing, and E. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In VLDB, pages 396-405. IEEE, 1997.
    • (1997) VLDB , pp. 396-405
    • Huang, Y.1    Jing, N.2    Rundensteiner, E.3
  • 9
    • 33947670542 scopus 로고    scopus 로고
    • Spatial join techniques
    • E. H. Jacox and H. Samet. Spatial join techniques. TODS, 32(1):7, 2007.
    • (2007) TODS , vol.32 , Issue.1 , pp. 7
    • Jacox, E.H.1    Samet, H.2
  • 10
    • 52649123163 scopus 로고    scopus 로고
    • Convoy queries in spatio-temporal databases
    • April
    • H. Jeung, H. T. Shen, and X. Zhou. Convoy queries in spatio-temporal databases. In ICDE, pages 1457-1459, April 2008.
    • (2008) ICDE , pp. 1457-1459
    • Jeung, H.1    Shen, H.T.2    Zhou, X.3
  • 12
    • 26444541854 scopus 로고    scopus 로고
    • On Discovering Moving Clusters in Spatio-temporal Data
    • Springer Verlag
    • P. Kalnis, N. Mamoulis, and S. Bakiras. On Discovering Moving Clusters in Spatio-temporal Data. In SSTD, page 364. Springer Verlag, 2005.
    • (2005) SSTD , pp. 364
    • Kalnis, P.1    Mamoulis, N.2    Bakiras, S.3
  • 13
    • 74049101218 scopus 로고
    • A new algorithm for processing joins using the multilevel grid file
    • World Scientific Press
    • S.-W. Kim, W.-S. Cho, M.-J. Lee, and K.-Y. Whang. A new algorithm for processing joins using the multilevel grid file. In DASFAA, pages 115-123. World Scientific Press, 1995.
    • (1995) DASFAA , pp. 115-123
    • Kim, S.-W.1    Cho, W.-S.2    Lee, M.-J.3    Whang, K.-Y.4
  • 14
    • 0031166031 scopus 로고    scopus 로고
    • Size separation spatial join
    • ACM New York, NY, USA
    • N. Koudas and K. Sevcik. Size separation spatial join. In SIGMOD, pages 324-335. ACM New York, NY, USA, 1997.
    • (1997) SIGMOD , pp. 324-335
    • Koudas, N.1    Sevcik, K.2
  • 15
    • 35449007737 scopus 로고    scopus 로고
    • Trajectory clustering: A partition-and-group framework
    • ACM New York, NY, USA
    • J. Lee, J. Han, and K. Whang. Trajectory clustering: A partition-and-group framework. In SIGMOD, pages 593-604. ACM New York, NY, USA, 2007.
    • (2007) SIGMOD , pp. 593-604
    • Lee, J.1    Han, J.2    Whang, K.3
  • 17
    • 84869139572 scopus 로고    scopus 로고
    • Mining user similarity based on location history
    • ACM New York, NY, USA
    • Q. Li, Y. Zheng, X. Xie, Y. Chen, W. Liu, and W. Ma. Mining user similarity based on location history. In ACM SIGSPATIAL. ACM New York, NY, USA, 2008.
    • (2008) ACM SIGSPATIAL
    • Li, Q.1    Zheng, Y.2    Xie, X.3    Chen, Y.4    Liu, W.5    Ma, W.6
  • 18
    • 29844438853 scopus 로고    scopus 로고
    • Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring
    • ACM New York, NY, USA
    • K. Mouratidis, D. Papadias, and M. Hadjieleftheriou. Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In SIGMOD, pages 634-645. ACM New York, NY, USA, 2005.
    • (2005) SIGMOD , pp. 634-645
    • Mouratidis, K.1    Papadias, D.2    Hadjieleftheriou, M.3
  • 19
    • 0030157411 scopus 로고    scopus 로고
    • Partition based spatial-merge join
    • J. Patel and D. DeWitt. Partition based spatial-merge join. ACM SIGMOD Record, 25(2):259-270, 1996.
    • (1996) ACM SIGMOD Record , vol.25 , Issue.2 , pp. 259-270
    • Patel, J.1    DeWitt, D.2
  • 21
    • 0005298186 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.
    • (2001) In SSTD
    • Song, Z.1    Roussopoulos, N.2
  • 22
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • VLDB Endowment
    • Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. In VLDB, pages 287-298. VLDB Endowment, 2002.
    • (2002) VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 23
    • 23944481004 scopus 로고    scopus 로고
    • Monitoring k-nearest neighbor queries over moving objects
    • X. Yu, K. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In ICDE, pages 631-642, 2005.
    • (2005) ICDE , pp. 631-642
    • Yu, X.1    Pu, K.2    Koudas, N.3
  • 24
    • 77952591806 scopus 로고    scopus 로고
    • X. Zhou, D. Abel, and D. Truffet. Data Partitioning for Parallel Spatial Join Processing. In SSD, pages 178-196. Springer-Verlag London, UK, 1997.
    • X. Zhou, D. Abel, and D. Truffet. Data Partitioning for Parallel Spatial Join Processing. In SSD, pages 178-196. Springer-Verlag London, UK, 1997.


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