Complex Spatio-Temporal Pattern Queries

This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial predicates where the predicate temporal ordering (exact or relative) matters. STP queries can use various types of spatial predicates (range search, nearest neighbor, etc.) where each such predicate is associated (1) with an exact temporal constraint (a time-instant or a time-interval), or (2) more generally, with a relative order among the other query predicates. Using traditional spatiotemporal index structures for these types of queries would be either inefficient or not an applicable solution. Alternatively, we propose specialized query evaluation algorithms for STP queries With Time. We also present a novel index structure, suitable for STP queries With Order. Finally, we conduct a comprehensive experimental evaluation to show the merits of our techniques.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[2]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[3]  Cédric du Mouza,et al.  Mobility Patterns , 2005, STDBM.

[4]  ChenMing-Syan,et al.  Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System , 2003 .

[5]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[6]  Divyakant Agrawal,et al.  Constrained Nearest Neighbor Queries , 2001, Encyclopedia of GIS.

[7]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[8]  Kyriakos Mouratidis,et al.  Group nearest neighbor queries , 2004, Proceedings. 20th International Conference on Data Engineering.

[9]  George Kollios,et al.  Mining, indexing, and querying historical spatiotemporal data , 2004, KDD.

[10]  Sharad Mehrotra,et al.  Querying Mobile Objects in Spatio-Temporal Databases , 2001, SSTD.

[11]  Ming-Syan Chen,et al.  Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System , 2003, IEEE Trans. Knowl. Data Eng..

[12]  Timos K. Sellis,et al.  Specifications for efficient indexing in spatiotemporal databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[13]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[14]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.

[15]  Yannis Manolopoulos,et al.  Spatiotemporal Access Methods , 2000 .

[16]  Amit P. Sheth,et al.  Semantic (Web) Technology In Action: Ontology Driven Information Systems for Search, Integration and Analysis , 2003, IEEE Data Eng. Bull..

[17]  Walid G. Aref,et al.  Spatio-Temporal Access Methods , 2003, IEEE Data Eng. Bull..

[18]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[19]  Dimitrios Gunopulos,et al.  Efficient Indexing of Spatiotemporal Objects , 2002, EDBT.

[20]  Yannis Theodoridis,et al.  Evaluation of Access Structures for Discretely Moving Points , 1999, Spatio-Temporal Database Management.

[21]  Klaus H. Hinrichs,et al.  Managing uncertainty in moving objects databases , 2004, TODS.

[22]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[23]  Jignesh M. Patel,et al.  Indexing Large Trajectory Data Sets With SETI , 2003, CIDR.

[24]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[25]  Man Lung Yiu,et al.  Non-contiguous Sequence Pattern Queries , 2004, EDBT.

[26]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.