Spatial Query Processing for High Resolutions

  • Authors:
  • Hans-Peter Kriegel;Martin Pfeifle;Marco Pötke;Thomas Seidl

  • Affiliations:
  • -;-;-;-

  • Venue:
  • DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern database applications including computer-aided design (CAD), medical imaging, or molecular biologyimpose new requirements on spatial query processing. Particular problems arise from the need of high resolutions orvery large spatial objects, including cars, space stations,planes and industrial plants, and from the design goal to usegeneral purpose database management systems in order toguarantee industrial-strength. In the past two decades, various stand-alone spatial index structures have been proposedbut their integration into fully-fledged database systems isproblematic. Most of these approaches are based on decomposition of spatial objects leading to replicating index structures. In contrast to common black-and-white decompositions which suffer from the lack of intermediate solutions, weintroduce grey approximations as a new and general concept. We demonstrate the benefits of grey approximations inthe context of encoding spatial objects by space fillingcurves resulting in grey interval sequences. Spatial intersection queries are then processed by a filter and refine architecture which, as an important design goal, can purely be expressed by means of the SQL:1999 standard. Our new HighResolution Indexing (HRI) method can easily be integratedinto general purpose DBMSs. The experimental evaluationon real-world test data from car and plane design projectspoints out that our new concept outperforms competitivetechniques that are implementable on top of a standard object-relational DBMS by an order of magnitude with respectto secondary storage space and overall query response time.