Efficient Window Block Retrieval in Quadtree-Based Spatial Databases

  • Authors:

  • Walid G. Aref;Hanan Samet

  • Affiliations:

  • Computer Science Department and Center for Automation Research and Institute for Advanced Computer Studies, The University of Maryland, College Park, Maryland 20742;Computer Science Department and Center for Automation Research and Institute for Advanced Computer Studies, The University of Maryland, College Park, Maryland 20742

  • Venue:
  • Geoinformatica
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window partitions. These partitions are the quadtree blocks corresponding to the window. Although a block b in the underlying spatial database may cover several of the smaller window partitions, b is only retrieved once rather than multiple times. This is achieved by using an auxiliary main memory data structure called the active border which requires O\left(n\right) additional storage for a window query of size n\times n. As a result, the algorithm generates an optimal number of disk I/O requests to answer a window query (i.e., one request per covering quadtree block). A proof of correctness and an analysis of the algorithm’sexecution time and space requirements are given, as are some experimental results.