Compact Trip Representation over Networks
Use this link to citehttp://hdl.handle.net/2183/18178
MetadataShow full item record
TitleCompact Trip Representation over Networks
Brisaboa N.R., Fariña A., Galaktionov D., Rodríguez M.A. (2016) Compact Trip Representation over Networks. In: Inenaga S., Sadakane K., Sakai T. (eds) String Processing and Information Retrieval. SPIRE 2016. Lecture Notes in Computer Science, vol 9954. Springer, Cham
[Abstract] We present a new Compact Trip Representation ( CTRCTR ) 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. CTRCTR 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 ( CSACSA ), 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 ( WMWM ). This gives us the ability to solve range-interval queries efficiently. We show how CTRCTR 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 CTRCTR .
Compact Trip Representation
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-46049-9_23