Compact Trip Representation over Networks

  • Nieves R. Brisaboa
  • Antonio Fariña
  • Daniil Galaktionov
  • M. Andrea Rodríguez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9954)

Abstract

We present a new Compact Trip Representation (\(\mathsf {CTR}\)) that allows us to manage users’ trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where nodes are stations or stops, or road networks where nodes are intersections. \(\mathsf {CTR}\) represents the sequences of nodes and time instants in users’ trips. The spatial component is handled with a data structure based on the well-known Compressed Suffix Array (\(\mathsf {CSA}\)), which provides both a compact representation and interesting indexing capabilities. We also represent the temporal component of the trips, that is, the time instants when users visit nodes in their trips. We create a sequence with these time instants, which are then self-indexed with a balanced Wavelet Matrix (\(\mathsf {WM}\)). This gives us the ability to solve range-interval queries efficiently. We show how \(\mathsf {CTR}\) can solve relevant spatial and spatio-temporal queries over large sets of trajectories. Finally, we also provide experimental results to show the space requirements and query efficiency of \(\mathsf {CTR}\).

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Nieves R. Brisaboa
    • 1
  • Antonio Fariña
    • 1
  • Daniil Galaktionov
    • 1
  • M. Andrea Rodríguez
    • 2
  1. 1.Database LaboratoryUniversity of A CoruñaA CoruñaSpain
  2. 2.Department of Computer ScienceUniversity of ConcepciónConcepciónChile

Personalised recommendations