Integrated query processing strategies for spatial path queries

Abstract

Investigates optimization strategies for processing path queries with embedded spatial constraints, such as avoiding areas with certain characteristics. To resolve complex spatial constraints during path finding, we consider two decisions: (1) the spatial relation operations (e.g. intersection) between areas and links can be pre-processed or intermixed with path-finding, and (2) areas satisfying the query constraint can be pre-filtered or dynamically selected during path-finding. Based on these two decisions, we propose and implement the resulting four integrated query processing strategies, utilizing state-of-the-art technologies such as spatial joins for intersect computation, R-tree access structure for spatial overlap searching, and spatial clustering for efficient path searching. In this paper, we also report an experimental evaluation to show which strategies perform best in different scenarios.