Hierarchical Constraint Satisfaction in Spatial Databases
نویسندگان
چکیده
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 decomposition of space, preserved by spatial data structures, to efficiently guide search. We study the conditions under which hierarchical constraint satisfaction outperforms traditional methods with extensive experimentation.
منابع مشابه
Constraint-Based Reasoning in Geographic Databases: the Case of Symbolic Arrays
Symbolic arrays are hierarchical constraint-based representations that preserve direction relations (e.g., north, northeast) among the distinct components of complex spatial entities. They have been used in problems involving pattern matching and spatial information retrieval. In this paper we demonstrate how inference can be achieved in geographic databases of symbolic arrays using composition...
متن کاملPact-97 Contribution : Personnel Assignment as a Problem of Hierarchical Constraint Satisfaction
The ConPlan project conducted by the German Research Center for Arti cial Intelligence in collaboration with the SIEDA Software house aimed at representing and solving nurse scheduling problems as a problem of optimizing constraint satisfaction. Shifts are assigned to the personnel complying with legal regulations, avoiding over-time work as far as possible and meeting as many additional requir...
متن کاملDatalog on infinite structures
Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal a...
متن کاملAn Approach to Over-constrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction
Many problems in multi-agent systems can be described as a distributed CSP. However, some real-life problem can be over-constrained and without a set of consistent variable values when described as a distributed CSP. We have presented a distributed partial CSP for handling such an over-constrained situation and a distributed maximal CSP as a subclass of distributed partial CSP. In this paper, w...
متن کامل