Hierarchical constraint satisfaction in spatial databases
Dimitris Papadias, Panos Kalnis, Nikos Mamoulis · 1999
Several content-based queries in spatial databases and geographic information systems (GISs) can be modelled and processed as constraint satisfaction problems (CSPs). Regular CSP algorithms, however, work for main memory retrieval without utilizing indices to prune the search space. This paper shows how systematic and local search techniques can take advantage of the hierarchical decom-position of space, preserved by spatial data structures, to efficiently guide search. We study the conditions under which hierarchical constraint satisfaction outperforms tra-ditional methods with extensive experimentation.