PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th 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 about the Past, the Present, and the Future in Spatio-Temporal Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
Indexing mobile objects on the plane revisited
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Hi-index | 0.00 |
Spatiotemporal databases emerge as an evolving scientific field due to a great variety of applications, tracking mobile objects being one of them. For this purpose, a number of methods have been proposed to efficiently organize and index moving objects and answer spatiotemporal queries. The majority of all these methods are addressing either the past or the future movement of the moving objects. Up until now, addressing both the past and the future movement of the objects in an integrated manner has rarely appeared in the literature. In the current paper, based on a spatiotemporal access method, the XBR-tree, we propose algorithms for the efficient processing of spatiotemporal window (past) and timestamp (past, present and future) queries. Moreover, we experimentally study the efficiency of processing these queries based on the XBR-tree against using an existing structure, the RPPF-tree.