Processing probabilistic spatio-temporal range queries over moving objects with uncertainty

Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. Evaluation of probabilistic queries is challenging due to large objects volume and costly computation. We map the uncertain movements of all objects to a dual space for indexing. By querying the index, we quickly eliminate unqualified objects and employ an approximate approach to examine the remaining candidates for final answer. We conduct a comprehensive performance study, which shows our proposal significantly reduces the number of object examinations and the overall cost of the query evaluation.

[1]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[2]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[3]  J. Kingman.  A FIRST COURSE IN STOCHASTIC PROCESSES , 1967 .

[4]  Jeffrey Scott Vitter,et al.  Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data , 2004, VLDB.

[5]  I. Miller.  Probability, Random Variables, and Stochastic Processes , 1966 .

[6]  Sunil Prabhakar,et al.  Evaluating probabilistic queries over imprecise data , 2003, SIGMOD '03.

[7]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[8]  Christos Faloutsos,et al.  Prediction and indexing of moving objects with unknown motion patterns , 2004, SIGMOD '04.

[9]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[10]  C. Rose,et al.  Minimizing the average cost of paging and registration: A timer-based method , 1996, Wirel. Networks.

[11]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[12]  Sunil Prabhakar,et al.  Querying imprecise data in moving object environments , 2003, IEEE Transactions on Knowledge and Data Engineering.

[13]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[14]  S. Ramey,et al.  Acknowledgement , 2000, NeuroImage.

[15]  Yufei Tao,et al.  Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions , 2005, VLDB.

[16]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[17]  Jonathan Goldstein,et al.  Processing queries by linear constraints , 1997, PODS '97.

[18]  Cem U. Saraydar,et al.  Paging area optimization based on interval estimation in wireless personal communication networks , 2000, Mob. Networks Appl..

[19]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[20]  H. V. Jagadish,et al.  On Indexing Line Segments , 1990, VLDB.

[21]  Dimitrios Gunopulos,et al.  Indexing mobile objects using dual transformations , 2004, The VLDB Journal.