Processing of Spatio-Temporal Queries in Image Databases

  • Authors:
  • Theodoros Tzouramanis;Michael Vassilakopoulos;Yannis Manolopoulos

  • Affiliations:
  • -;-;-

  • Venue:
  • ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
  • Year:
  • 1999
  • Distributed Searching of k-Dimensional Data with Almost Constant Costs

    ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems

  • Multiversion Linear Quadtree for Spatio-Temporal Data

    ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems

Quantified Score

Hi-index 0.00

Visualization

Abstract

Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure saves considerable space without sacrificing time performance in accessing every single image. Moreover, it can be used for answering efficiently window queries for a number of consecutive images (spatio-temporal queries). In this paper, we present three such temporal window queries: strict containment, border intersect and cover. Besides, based on a method of producing synthetic pairs of evolving images (random images with specified aggregation) we present empirical results on the I/O performance of these queries.