The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Maintaining knowledge about temporal intervals
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
IEEE Transactions on Knowledge and Data Engineering
Algorithms for Querying by Spatial Structure
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Improving search using indexing: a study with temporal CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Improving search using indexing: a study with temporal CSPs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Qualitative matching of spatial information
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Solving constraints on sets of spatial objects
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Spatial reasoning with rectangular cardinal relations
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Several content-based queries in spatial databases and geographic infonnation 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 decomposition of space, preserved by spatial data structures, to efficiently guide search. We study the conditions under which hierarchical constraint satisfaction outperfonns traditional methods with extensive experimentation.