Discovery of convoys in trajectory databases

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 1068-1080

  Jeung, Hoyoung ^a   Yiu, Man Lung ^b   Zhou, Xiaofang ^a   Jensen, Christian S ^b   Shen, Heng Tao ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION MANAGEMENT; POPULATION STATISTICS;

DENSITY-BASED; DISTANCE BOUND; EMPIRICAL STUDIES; MOVING OBJECTS; REAL-LIFE APPLICATIONS; REAL-WORLD TRAJECTORIES; REFINEMENT STEP; TRAJECTORY DATABASE;

TRAJECTORIES;

EID: 84859203289     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453971     Document Type: Article

References (26)

1. Inrix, Inc. Smart Dust Network. http://www.inrix.com/techdustnetwork.asp.
2. http://www.rtreeportal.org/
3. http://daisy.aau.dk/
4. H. Jeung, H. T. Shen, and X. Zhou. Convoy Queries in Spatio-Temporal Databases. In ICDE, pp. 1457-1459, 2008.
5. G. Al-Naymat, S. Chawla, and J. Gudmundsson. Dimensionality reduction of long duration and complex spatio-temporal queries. In ACM SAC, pp. 393-397, 2007.
6. S. Arumugam and C. Jermaine. Closest-point-of-approach join for moving object histories. In ICDE, p. 86, 2006.
7. P. Bakalov, M. Hadjieleftheriou, and V. J. Tsotras. Time relaxed spatiotemporal trajectory joins. In ACM GIS, pp. 182-191, 2005.
8. H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. VLDBJ, 15(3): 211-228, 2006.
9. L. Chen and R. T. Ng. On the marriage of lp-norms and edit distance. In VLDB, pp. 792-803, 2004.
10. L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In SIGMOD, pp. 491-502, 2005.
11. D. Douglas and T. Peucker. Algorithms for the reduction of the number of points required to represent a line or its character. The American Cartographer, 10(42):112-123, 1973.
12. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In SIGKDD, pp. 226-231, 1996.
13. J. Gudmundsson and M. van Kreveld. Computing longest duration flocks in trajectory data. In ACM GIS, pp. 35-42, 2006.
14. J. Gudmundsson, M. van Kreveld, and B. Speckmann. Efficient detection of motion patterns in spatio-temporal data sets. In ACM GIS, pp. 250-257, 2004.
15. D. Gunopoulos. Discovering similar multidimensional trajectories. In ICDE, pp. 673-684, 2002.
16. J. Hershberger and J. Snoeyink. Speeding up the douglas-peucker line-simplification algorithm. In International Symposium on Spatial Data Handling, pp. 134-143, 1992.
17. C. S. Jensen, D. Lin, and B. C. Ooi. Continuous clustering of moving objects. IEEE TKDE, 19(9): 1161-1174, 2007.
18. S. Jeong, N. Paton, A. Fernandes, and T. Griffiths. An experimental performance evaluation of spatiotemporal join strategies. Transactions in GIS, 9(2):129-156, 2005.
19. P. Kalnis, N. Mamoulis, and S. Bakiras. On discovering moving clusters in spatio-temporal data. In SSTD, pp. 364-381, 2005.
20. J. Lee, J. Han, and K.-Y. Whang. Trajectory clustering: A partition-and-group framework. In SIGMOD, pp. 593-604, 2007.
21. Y. Li, J. Han, and J. Yang. Clustering moving objects. In SIGKDD, pp. 617-622, 2004.
22. Z. Li. An algorithm for compressing digital contour data. The Cartographic Journal, 25(2): 143-146, 1988.
23. N. Meratnia and R. A. de By. Spatiotemporal compression techniques for moving point objects. In EDBT, pp. 765-782, 2004.
24. M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult. Monic: modeling and monitoring cluster transitions. In SIGKDD, pp. 706-711, 2006.
25. B. Yi, H. V. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In ICDE, pp. 201-208, 1998.
26. P. Zhou, D. Zhang, B. Salzberg, G. Cooperman, and G. Kollios. Close pair queries in moving object databases. In ACM GIS, pp. 2-11, 2005.