Searching trajectories by locations: An efficiency study

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 255-266

  Chen, Zaiben ^a   Shen, Heng Tao ^a   Zhou, Xiaofang ^a   Zheng, Yu ^b   Xie, Xing ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

efficiency; locations; optimization; trajectory search

Indexed keywords

DEPTH FIRST; IN-DEPTH STUDY; K-NN ALGORITHM; LOWER BOUNDS; MEMORY USAGE; NOVEL APPLICATIONS; SIMILARITY FUNCTIONS; SPATIAL DISTANCE; SPATIAL INDICES; SPATIAL TEMPORALS; TRIP PLANNING; UPPER BOUND;

ALGORITHMS; OPTIMIZATION;

TRAJECTORIES;

EID: 77954744991     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807197     Document Type: Conference Paper

References (22)

1. http://research.microsoft.com/en-us/projects/geolife/.
2. R. Agrawal, C. Faloutsos, and A. N. Swami. Efficient similarity search in sequence databases. In FODO, pages 69-84, 1993.
3. A. Belussi and C. Faloutsos. Estimating the selectivity of spatial queries using the 'correlation' fractal dimension. In VLDB, pages 299-310, 1995.
4. C. Böhm. A cost model for query processing in high dimensional data spaces. TODS, 25(2):129-178, 2000.
5. Y. Cai and R. Ng. Indexing spatio-temporal trajectories with chebyshev polynomials. In SIGMOD, pages 599-610, 2004.
6. K.-P. Chan and A. W.-C. Fu. Efficient time series matching by wavelets. In ICDE, pages 126-133, 1999.
7. L. Chen and R. Ng. On the marriage of lp-norms and edit distance. In VLDB, pages 792-803, 2004.
8. L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In SIGMOD, pages 491-502, 2005.
9. H. Ding, G. Trajcevski, P. Scheuermann, X. Wang, and E. Keogh. Querying and mining of time series data: experimental comparison of representations and distance measures. PVLDB, pages 1542-1552, 2008.
10. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In SIGMOD, pages 419-429, 1994.
11. E. Frentzos, K. Gratsias, N. Pelekis, and Y. Theodoridis. Algorithms for nearest neighbor search on moving object trajectories. Geoinformatica, 11(2):159-193, 2007.
12. E. Frentzos, K. Gratsias, and Y. Theodoridis. Index-based most similar trajectory search. In ICDE, pages 816-825, 2007.
13. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
14. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. TODS, 24(2):265-318, 1999.
15. F. Korn, B.-U. Pagel, and C. Faloutsos. On the 'dimensionality curse' and the 'self-similarity blessing'. TKDE, 13(1):96-111, 2001.
16. M. D. Morse and J. M. Patel. An efficient and accurate method for evaluating time series similarity. In SIGMOD, pages 569-580, 2007.
17. A. Papadopoulos and Y. Manolopoulos. Performance of nearest neighbor queries in r-trees. In ICDT, pages 394-408, 1997.
18. D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, pages 395-406, 2000.
19. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD, pages 71-79, 1995.
20. R. Sherkat and D. Rafiei. On efficiently searching trajectories and archival data for historical similarities. PVLDB, pages 896-908, 2008.
21. M. Vlachos, G. Kollios, and D. Gunopulos. Discovering similar multidimensional trajectories. In ICDE, pages 673-684, 2002.
22. B.-K. Yi, H. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In ICDE, pages 201-208, 1998.