Kristian Torp
ABSTRACT
The large search companies have very clearly shown that full-text search on very large datasets can be executed efficiently. In this paper, we show how querying spatio-temporal trajectory data can be converted to a full-text search problem. This allows for the reuse of efficient data and index structures from the full-text domain. The core idea is to convert a trajectory into a document consisting of spatial and temporal terms. For example, spatial terms are municipality names, zip codes, or road-network segment numbers. Temporal terms are, for example, morning, weekday, spring, and 2020. Using a dataset consisting of +62 million trajectories (24.9 billion GPS points) we show how to query this dataset efficiently. These queries cover spatial, temporal, and spatio-temporal queries.
- Ahmed R Mahmood, Sri Punni, and Walid G Aref. 2019. Spatio-temporal access methods: a survey (2010--2017). GeoInformatica 23, 1 (2019), 1--36.Google Scholar
Digital Library
- Paul Newson and John Krumm. 2009. Hidden Markov Map Matching through Noise and Sparseness. In ACM SIGSPATIAL. 336--343.Google Scholar
- Ruijie Tian, Huawei Zhai, Weishi Zhang, Fei Wang, and Yao Guan. 2022. A Survey of Spatio-Temporal Big Data Indexing Methods in Distributed Environment. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 15 (2022), 4132--4155. Google ScholarCross Ref
Index Terms
- Efficient network-constrained trajectory queries
Recommendations
Temporally enhanced network-constrained (TENC) R-tree
MobiGIS '16: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsThis paper describes a new Network-constrained Moving objects indexing structure, which extends the state-of-the-art for this kind of data. The indexing structure we propose is called Temporally Enhanced Network-Constrained R-tree (TENC R-tree), which ...
Distributed skyline trajectory query processing
ACM TURC '17: Proceedings of the ACM Turing 50th Celebration Conference - ChinaThe massive amount of trajectory data collected from GPS has emerged in recent year. Many researchers proposed trajectory queries such as top-k query. They focused to solve them based on distance and text relevance. However, the weight of these queries ...
Indexing frequently updated trajectories of network-constrained moving objects
DEXA'11: Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part IIIndex is a key technique in improving the query processing performance of moving objects databases. However, current index methods for moving object trajectories take trajectory units as the basic index records and frequent index updates are needed when ...
Comments