QQESPM: A Quantitative and Qualitative Spatial Pattern Matching Algorithm
For spatial database users needing both quantitative distance and qualitative connectivity constraints in POI retrieval, this work provides a novel query type and algorithm, though it is an incremental extension of existing work.
The paper extends Spatial Pattern Matching (SPM) queries to include qualitative connectivity constraints, introducing the QQ-SPM query and the QQESPM algorithm. Experiments show QQESPM outperforms a baseline approach in efficiency.
The Spatial Pattern Matching (SPM) query allows for the retrieval of Points of Interest (POIs) based on spatial patterns defined by keywords and distance criteria. However, it does not consider the connectivity between POIs. In this study, we introduce the Qualitative and Quantitative Spatial Pattern Matching (QQ-SPM) query, an extension of the SPM query that incorporates qualitative connectivity constraints. To answer the proposed query type, we propose the QQESPM algorithm, which adapts the state-of-the-art ESPM algorithm to handle connectivity constraints. Performance tests comparing QQESPM to a baseline approach demonstrate QQESPM's superiority in addressing the proposed query type.