Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On moving object queries: (extended abstract)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
SEQ: A Model for Sequence Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Expressing and optimizing sequence queries in database systems
ACM Transactions on Database Systems (TODS)
Indexing spatio-temporal trajectories with Chebyshev polynomials
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient evaluation of parameterized pattern queries
Proceedings of the 14th ACM international conference on Information and knowledge management
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Global distance-based segmentation of trajectories
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient pattern matching over event streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams
The VLDB Journal — The International Journal on Very Large Data Bases
From a stream of relational queries to distributed stream processing
Proceedings of the VLDB Endowment
Voronoi-based range query for trajectory data in spatial networks
Proceedings of the 2011 ACM Symposium on Applied Computing
FlexTrack: a system for querying flexible patterns in trajectory databases
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
On the spatiotemporal burstiness of terms
Proceedings of the VLDB Endowment
Stream-Mode FPGA acceleration of complex pattern trajectory querying
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
A ranking measure for top-k moving object trajectories search
Proceedings of the 7th Workshop on Geographic Information Retrieval
| Hi-index | 0.00 |
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work on querying/analyzing trajectorial data typically falls into methods that either address spatial range and NN queries, or, similarity based queries. Nevertheless, trajectories are complex objects whose behavior over time and space can be better captured as a sequence of interesting events. We thus facilitate the use of motion "pattern" queries which allow the user to select trajectories based on specific motion patterns. Such patterns are described as regular expressions over a spatial alphabet that can be implicitly or explicitly anchored to the time domain. Moreover, we are interested in "flexible" patterns that allow the user to include "variables" in the query pattern and thus greatly increase its expressive power. In this paper we introduce a framework for efficient processing of flexible pattern queries. The framework includes an underlying indexing structure and algorithms for query processing using different evaluation strategies. An extensive performance evaluation of this framework shows significant performance improvement when compared to existing solutions.