Computational geometry: an introduction
Computational geometry: an introduction
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
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth 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
Advanced Engineering Mathematics: Maple Computer Guide
Advanced Engineering Mathematics: Maple Computer Guide
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Prediction and indexing of moving objects with unknown motion patterns
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Motion adaptive indexing for moving continual queries over moving objects
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Venn Sampling: A Novel Prediction Technique for Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient Processing of Continual Range Queries for Location-Aware Mobile Services
Information Systems Frontiers
Processing Moving Queries over Moving Objects Using Motion-Adaptive Indexes
IEEE Transactions on Knowledge and Data Engineering
On-line data reduction and the quality of history in moving objects databases
MobiDE '06 Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
Incremental Processing of Continual Range Queries over Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Update-efficient indexing of moving objects in road networks
Geoinformatica
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Path prediction and predictive range querying in road network databases
The VLDB Journal — The International Journal on Very Large Data Bases
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Ranking continuous nearest neighbors for uncertain trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
PNN query processing on compressed trajectories
Geoinformatica
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
Stream-Mode FPGA acceleration of complex pattern trajectory querying
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area have proposed indexing schemes for objects with linear trajectories in one or two dimensions. In this paper, we present methods for indexing objects with nonlinear trajectories. Specifically, we identify a useful condition called the convex hull property and show that any trajectory satisfying this condition can be indexed by storing a careful representation of these objects in a traditional index structure. Since a wide variety of relevant nonlinear trajectories satisfy this condition, our result significantly expands the class of trajectories for which nearest neighbor indexing schemes can be devised. We also show that even though many non-linear trajectories do not satisfy the convex hull condition, an approximate representation can often be found which satisfies it. We discuss examples of techniques which can be utilized to find representations that satisfy the convex hull property. We present empirical results to demonstrate the effectiveness of our indexing method.