TS2-tree - an efficient similarity based organization for trajectory data

  • Authors:
  • Petko Bakalov;Eamonn Keogh;Vassilis J. Tsotras

  • Affiliations:
  • University of California, Riverside;University of California, Riverside;University of California, Riverside

  • Venue:
  • Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query trajectories of moving objects. In this paper we introduce TS2 tree, a novel indexing structure for organizing trajectory data based on similarity between trajectories. TS2 tree provides lower and upper bounds on distance between trajectories, based on which we propose a general framework for effectively answering a wide range of similarity-based trajectory queries such as similarity threshold (ST) query and similarity best fit (SBF) query. The multifold reduction in query computation times and the number of I/O operations is demonstrated through an extensive experimental evaluation.