Abstract
We describe the FlexTrack system for querying trajectories using flexible pattern queries. Such queries are composed of a sequence of simple spatio-temporal predicates, e.g., range and nearest-neighbors, as well as complex motion pattern predicates, e.g., predicates that contain variables and constraints. Users can interactively select spatio-temporal predicates to construct such pattern queries using a hierarchy of regions that partition the spatial domain. Several different query processing algorithms are currently implemented and available in the FlexTrack system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vieira, M.R., Bakalov, P., Tsotras, V.J.: Querying trajectories using flexible pat terns. In: EDBT, pp. 406–417 (2010)
Vieira, M.R., Martínez, E.F., Bakalov, P., Martínez, V.F., Tsotras, V.J.: Querying spatio-temporal patterns in mobile phone-call databases. In: MDM, pp. 239–248 (2010)
Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. on Computing (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vieira, M.R., Bakalov, P., Tsotras, V.J. (2011). FlexTrack: A System for Querying Flexible Patterns in Trajectory Databases. In: Pfoser, D., et al. Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22922-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22921-3
Online ISBN: 978-3-642-22922-0
eBook Packages: Computer ScienceComputer Science (R0)