Efficient Processing of Spatiotemporal Pattern Queries on Historical Frequent Co-Movement Pattern Datasets

  • Shahab Helmi
  • Farnoush Banaei-Kashani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10731)


Thanks to recent prevalence of location sensors, collecting massive spatiotemporal datasets containing moving object trajectories has become possible, providing an exceptional opportunity to derive interesting insights about behavior of the moving objects such as people, animals, and vehicles. In particular, mining patterns from co-movements of objects (such as movements by players of a sports team, joints of a person while walking, and cars in a transportation network) can lead to the discovery of interesting patterns (e.g., offense tactics of a sports team, gait signature of a person, and driving behaviors causing heavy traffic). Given a dataset of frequent co-movement patterns, various spatial and spatiotemporal queries can be posed to retrieve relevant patterns among all generated patterns from the pattern dataset. We term such queries, pattern queries. Co-movement patterns are often numerous due to combinatorial complexity of such patterns, and therefore, co-movement pattern datasets often grow very large in size, rendering naive execution of the pattern queries ineffective. In this paper, we propose the FCPIR framework, which offers a variety of index structures for efficient answering of various range pattern queries on massive co-movement pattern datasets, namely, spatial range pattern queries, temporal range (time-slice) pattern queries, and spatiotemporal range pattern queries.


Spatiotemporal indexing Spatiotemporal query processing Pattern query 


  1. 1.
    Chakka, V.P., Everspaugh, A.C., Patel, J.M.: Indexing large trajectory data sets with SETI. Ann Arbor 1001(48109–2122), 12 (2003)Google Scholar
  2. 2.
    Helmi, S., Banaei-Kashani, F.: Mining frequent episodes from multivariate spatiotemporal event sequences. In: Proceedings of the 7th ACM SIGSPATIAL International Workshop on GeoStreaming, p. 9. ACM (2016)Google Scholar
  3. 3.
    Laxman, S., Sastry, P., Unnikrishnan, K.: A fast algorithm for finding frequent episodes in event streams. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 410–419. ACM (2007)Google Scholar
  4. 4.
    Mamoulis, N., Cao, H., Kollios, G., Hadjieleftheriou, M., Tao, Y., Cheung, D.W.: Mining, indexing, and querying historical spatiotemporal data. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 236–245. ACM (2004)Google Scholar
  5. 5.
    Moreira-Matias, L., Gama, J., Ferreira, M., Mendes-Moreira, J., Damas, L.: Predicting taxi-passenger demand using streaming data. IEEE Trans. Intell. Transp. Syst. 14(3), 1393–1402 (2013)CrossRefGoogle Scholar
  6. 6.
    Mouza, C., Rigaux, P.: Mobility patterns. GeoInformatica 9(4), 297–319 (2005)CrossRefGoogle Scholar
  7. 7.
    Nanopoulos, A., Manolopoulos, Y.: Efficient similarity search for market basket data. VLDB J. Int. J. Very Large Data Bases 11(2), 138–152 (2002)CrossRefGoogle Scholar
  8. 8.
    Nori, F., Deypir, M., Sadreddini, M.H.: A sliding window based algorithm for frequent closed itemset mining over data streams. J. Syst. Softw. 86(3), 615–623 (2013)CrossRefGoogle Scholar
  9. 9.
    Pfoser, D., Jensen, C.S., Theodoridis, Y., et al.: Novel approaches to the indexing of moving object trajectories. In: Proceedings of VLDB, pp. 395–406 (2000)Google Scholar
  10. 10.
    Sakr, M.A., Güting, R.H.: Group spatiotemporal pattern queries. GeoInformatica 18(4), 699–746 (2014)CrossRefGoogle Scholar
  11. 11.
    Tao, Y., Papadias, D.: Efficient historical R-trees. In: Thirteenth International Conference on Scientific and Statistical Database Management, SSDBM 2001. Proceedings, pp. 223–232. IEEE (2001)Google Scholar
  12. 12.
    Yun, U., Lee, G.: Incremental mining of weighted maximal frequent itemsets from dynamic databases. Expert Syst. Appl. 54, 304–327 (2016)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of Colorado DenverDenverUSA

Personalised recommendations