Efficient processing of past-future spatiotemporal queries

  • Authors:
  • Katerina Raptopoulou;Michael Vassilakopoulos;Yannis Manolopoulos

  • Affiliations:
  • Aristotle University of Thessaloniki, Greece;Technological Educational Institute of Thessaloniki, Greece;Aristotle University of Thessaloniki, Greece

  • Venue:
  • Proceedings of the 2006 ACM symposium on Applied computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.