Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th 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
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Efficient indexing of the historical, present, and future positions of moving objects
Proceedings of the 6th international conference on Mobile data management
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Robust B+-Tree-Based Indexing of Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Relaxed space bounding for moving objects: a case for the buddy tree
ACM SIGMOD Record
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
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
A benchmark for evaluating moving object indexes
Proceedings of the VLDB Endowment
A Hybrid Prediction Model for Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
The COST benchmark—comparison and evaluation of spatio-temporal indexes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An adaptive updating protocol for reducing moving object database workload
Proceedings of the VLDB Endowment
Probabilistic range queries for uncertain trajectories on road networks
Proceedings of the 14th International Conference on Extending Database Technology
Probabilistic time consistent queries over moving objects
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
MOVIES: indexing moving objects by shooting index images
Geoinformatica
An adaptive updating protocol for reducing moving object database workload
The VLDB Journal — The International Journal on Very Large Data Bases
Effectively indexing the multi-dimensional uncertain objects for range searching
Proceedings of the 15th International Conference on Extending Database Technology
Path skyline for moving objects
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Probabilistic range monitoring of streaming uncertain positions in geosocial networks
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
MOIST: a scalable and parallel moving object indexer with school tracking
Proceedings of the VLDB Endowment
Indexing uncertain spatio-temporal data
Proceedings of the 21st ACM international conference on Information and knowledge management
Panda: a predictive spatio-temporal query processor
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Calibrating trajectory data for similarity-based analysis
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Finding traffic-aware fastest paths in spatial networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
Moving object indexing and query processing is a well studied research topic, with applications in areas such as intelligent transport systems and location-based services. While much existing work explicitly or implicitly assumes a deterministic object movement model, real-world objects often move in more complex and stochastic ways. This paper investigates the possibility of a marriage between moving-object indexing and probabilistic object modeling. Given the distributions of the current locations and velocities of moving objects, we devise an efficient inference method for the prediction of future locations. We demonstrate that such prediction can be seamlessly integrated into existing index structures designed for moving objects, thus improving the meaningfulness of range and nearest neighbor query results in highly dynamic and uncertain environments. The paper reports on extensive experiments on the Bx-tree that offer insights into the properties of the paper's proposal.