Querying moving objects with uncertainty in spatio-temporal databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Balloon: representing and querying the near future movement of predictive moving objects
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Spatial Semantics and Ontologies
Uncertain time-series similarity: return to the basics
Proceedings of the VLDB Endowment
Indexing uncertain spatio-temporal data
Proceedings of the 21st ACM international conference on Information and knowledge management
P2EST: parallelization philosophies for evaluating spatio-temporal queries
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
| Hi-index | 0.00 |
We address the problem of efficient processing of spatio-temporal range queries for moving objects whose whereabouts in time are not known exactly. The fundamental question tackled by such queries is, given a spatial region and a temporal interval, retrieve the objects that were inside the region during the given interval. As earlier works have demonstrated, when the location, time information is uncertain, syntactic constructs are needed to capture the impact of the uncertainty, along with the corresponding processing algorithms. In this work, we focus on the uncertainty model that represents the whereabouts in-between two known locations as a bead and an uncertain trajectory is represented as a necklace -- a sequence of beads. For each syntactic variant of the range query, we present the respective processing algorithms and, in addition, we propose pruning strategies that speed up the generation of the queries' answers. We also present the experimental observations that quantify the benefits of our proposed methodologies.