We consider the problem of indexing massive trajectory data in an underlying road network. Our Pathfinder index structure is based on a state-of-the-art speed-up technique for shortest path planning and allows to both compress and access huge amounts of trajectory data. In a continent-sized network with more than 400 million nodes and almost a billion edges, Pathfinder allows to retrieve all trajectories within a given space-time cube in a few microseconds per reported trajectory. The applicability of Pathfinder is shown using both synthetic and real-world trajectory sets.
%0 Conference Paper
%1 Funke:2019:PSI:3340964.3340978
%A Funke, Stefan
%A Rupp, Tobias
%A Nusser, André
%A Storandt, Sabine
%B Proceedings of the 16th International Symposium on Spatial and Temporal Databases
%C New York, NY, USA
%D 2019
%I ACM
%K myown
%P 90--99
%R 10.1145/3340964.3340978
%T PATHFINDER: Storage and Indexing of Massive Trajectory Sets
%U http://doi.acm.org/10.1145/3340964.3340978
%X We consider the problem of indexing massive trajectory data in an underlying road network. Our Pathfinder index structure is based on a state-of-the-art speed-up technique for shortest path planning and allows to both compress and access huge amounts of trajectory data. In a continent-sized network with more than 400 million nodes and almost a billion edges, Pathfinder allows to retrieve all trajectories within a given space-time cube in a few microseconds per reported trajectory. The applicability of Pathfinder is shown using both synthetic and real-world trajectory sets.
%@ 978-1-4503-6280-1
@inproceedings{Funke:2019:PSI:3340964.3340978,
abstract = {We consider the problem of indexing massive trajectory data in an underlying road network. Our Pathfinder index structure is based on a state-of-the-art speed-up technique for shortest path planning and allows to both compress and access huge amounts of trajectory data. In a continent-sized network with more than 400 million nodes and almost a billion edges, Pathfinder allows to retrieve all trajectories within a given space-time cube in a few microseconds per reported trajectory. The applicability of Pathfinder is shown using both synthetic and real-world trajectory sets.},
acmid = {3340978},
added-at = {2019-08-28T11:17:23.000+0200},
address = {New York, NY, USA},
author = {Funke, Stefan and Rupp, Tobias and Nusser, Andr{\'e} and Storandt, Sabine},
biburl = {https://www.bibsonomy.org/bibtex/2b375ca985b97be8a764ed0ea75d4f02e/ruppts},
booktitle = {Proceedings of the 16th International Symposium on Spatial and Temporal Databases},
doi = {10.1145/3340964.3340978},
interhash = {da484ad22490d2fb9cbf19cfae4be172},
intrahash = {b375ca985b97be8a764ed0ea75d4f02e},
isbn = {978-1-4503-6280-1},
keywords = {myown},
location = {Vienna, Austria},
numpages = {10},
pages = {90--99},
publisher = {ACM},
series = {SSTD '19},
timestamp = {2019-08-28T11:29:03.000+0200},
title = {PATHFINDER: Storage and Indexing of Massive Trajectory Sets},
url = {http://doi.acm.org/10.1145/3340964.3340978},
year = 2019
}