English

Efficient Compression and Indexing of Trajectories

Data Structures and Algorithms 2017-10-06 v1

Abstract

We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical minimum-bounding-boxes representation that allows determining if the object is seen in a certain rectangular area during a time period. Combined with spatial snapshots at regular intervals, the representation is shown to outperform classical ones by orders of magnitude in space, and also to outperform previous compressed representations in time performance, when using the same amount of space.

Keywords

Cite

@article{arxiv.1710.01952,
  title  = {Efficient Compression and Indexing of Trajectories},
  author = {Nieves R. Brisaboa and Travis Gagie and Adrián Gómez-Brandón and Gonzalo Navarro and José R. Paramá},
  journal= {arXiv preprint arXiv:1710.01952},
  year   = {2017}
}

Comments

This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie Actions H2020-MSCA-RISE-2015 BIRDS GA No. 690941

R2 v1 2026-06-22T22:04:29.866Z