The design and analysis of spatial data structures
The design and analysis of spatial data structures
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Range and kNN query processing for moving objects in grid model
Mobile Networks and Applications
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
STRIPES: an efficient index for predicted trajectories
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
PIPES: a public infrastructure for processing and exploring streams
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)
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal 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
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
Efficient Maintenance of Continuous Queries for Trajectories
Geoinformatica
Discovery of convoys in trajectory databases
Proceedings of the VLDB Endowment
Semantics and implementation of continuous sliding window queries over data streams
ACM Transactions on Database Systems (TODS)
Continuous Intersection Joins Over Moving Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Indexing Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimizing moving queries over moving object data streams
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Querying the future of spatio-temporal objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Clustering spatial data streams for targeted alerting in disaster response
Proceedings of the 4th ACM SIGSPATIAL International Workshop on GeoStreaming
Hi-index | 0.00 |
Since navigation systems and tracking devices are becoming ubiquitous in our daily life, the development of efficient methods for processing massive sets of mobile objects are of utmost importance. Although future routes of mobile objects are often known in advance in many applications, this information is not fully utilized in most methods so far. In this paper, we reveal the beneficial effects of exploiting future routes for the early generation of the expected results of spatio-temporal queries. This kind of probable results is important for operative analytics in many applications like smart fleet management or intelligent logistics. For efficiently computing the high number of future trajectory points, a new index structure is presented which allows for a fast maintenance of query results under continuous changes of mobile objects. Our methods make use of specific update patterns, which require substantially less maintenance costs than the most general case of an update. A set of experiments based on a commonly used simulation environment shows the efficiency of our approach.