Continuous probabilistic nearest-neighbor queries for uncertain trajectories

This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular time instant is not known, but is bounded by an uncertainty region. As has already been observed in the literature, the answers to continuous NN-queries in spatio-temporal settings are time parameterized in the sense that the objects in the answer vary over time. Incorporating uncertainty in the model yields additional attributes that affect the semantics of the answer to this type of queries. In this work, we formalize the impact of uncertainty on the answers to the continuous probabilistic NN-queries, provide a compact structure for their representation and efficient algorithms for constructing that structure. We also identify syntactic constructs for several qualitative variants of continuous probabilistic NN-queries for uncertain trajectories and present efficient algorithms for their processing.

• Type: Conference
• Year: 2009
• Where: EDBT
• Authors: Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter Scheuermann, Isabel F. Cruz
• Keywords: Continuous Nearest Neighbor, Continuous Probabilistic Nn-queries, Database, EDBT 2009, Particular Time Instant