Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Paging area optimization based on interval estimation in wireless personal communication networks
Mobile Networks and Applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing multi-dimensional uncertain data with arbitrary probability density functions
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient indexing methods for probabilistic threshold queries over uncertain data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Uncertain distance-based range queries over uncertain moving objects
Journal of Computer Science and Technology
Probabilistic time consistent queries over moving objects
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
MNTG: an extensible web-based traffic generator
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
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.