Two-level indexes have been widely used to handle trajectories of moving objects that are constrained to a network. The top-level of these indexes handles the spatial dimension, whereas the bottom level handles the temporal dimension. The latter turns out to be an instance of the interval-intersection problem, but it has been tackled by non-specialized spatial indexes. In this work, we propose the use of a compact data structure on the bottom level of these indexes. Our experimental evaluation shows that our approach is both faster and smaller than existing solutions.
@article{arxiv.1901.01172,
title = {Faster and Smaller Two-Level Index for Network-based Trajectories},
author = {Rodrigo Rivera and Andrea Rodríguez and Diego Seco},
journal= {arXiv preprint arXiv:1901.01172},
year = {2019}
}
Comments
This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941