The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Recovering from Main-Memory Lapses
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Spatial queries in dynamic environments
ACM Transactions on Database Systems (TODS)
Analysis of predictive spatio-temporal queries
ACM Transactions on Database Systems (TODS)
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
IEEE Transactions on Knowledge and Data Engineering
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
The VLDB Journal — The International Journal on Very Large Data Bases
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
Primal or dual: which promises faster spatiotemporal search?
The VLDB Journal — The International Journal on Very Large Data Bases
A benchmark for evaluating moving object indexes
Proceedings of the VLDB Endowment
Continuous Intersection Joins Over Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
The RUM-tree: supporting frequent updates in R-trees using memos
The VLDB Journal — The International Journal on Very Large Data Bases
Using compressed index structures for processing moving objects in large spatio-temporal databases
Journal of Systems and Software
DuoWave: Mitigating the curse of dimensionality for uncertain data
Data & Knowledge Engineering
Boosting moving object indexing through velocity partitioning
Proceedings of the VLDB Endowment
Panda: a predictive spatio-temporal query processor
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Countering overlapping rectangle privacy attack for moving kNN queries
Information Systems
International Journal of Intelligent Information and Database Systems
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
DesTeller: a system for destination prediction based on trajectories with privacy protection
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
There have been many studies on management of moving objects recently. Most of them try to optimize the performance of predictive window queries. However, not much attention is paid to two other important query types: the predictive range query and the predictive k nearest neighbor query. In this article, we focus on these two types of queries. The novelty of our work mainly lies in the introduction of the Transformed Minkowski Sum, which can be used to determine whether a moving bounding rectangle intersects a moving circular query region. This enables us to use the traditional tree traversal algorithms to perform range and kNN searches. We theoretically show that our algorithms based on the Transformed Minkowski Sum are optimal in terms of the number of tree node accesses. We also experimentally verify the effectiveness of our technique and show that our algorithms outperform alternative approaches.