Arc and path consistence revisited
Artificial Intelligence
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
Towards a theory of spatial database queries (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Spatial data integrity constraints in object oriented geographic data modeling
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Modeling spatio-temporal constraints for multimedia objects
Data & Knowledge Engineering
Constraint-generating dependencies
Journal of Computer and System Sciences
A Taxonomy of Spatial Data Integrity Constraints
Geoinformatica
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
On Topological Elementary Equivalence of Spatial Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
GraphDB: Modeling and Querying Graphs in Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Model for Expressing topological Integrity Constraints in Geographic Databases
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
Journal of Computer and System Sciences - STOC 2001
On Topological Consistency and Realization
Constraints
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Conceptually modeling windows and bounds for space and time in database constraints
Communications of the ACM - Remembering Jim Gray
IEEE Transactions on Knowledge and Data Engineering
Categories of Geospatial and Temporal Integrity Constraints
GEOWS '09 Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Reasoning on spatial semantic integrity constraints
COSIT'07 Proceedings of the 8th international conference on Spatial information theory
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Consistent query answering under spatial semantic constraints
Information Systems
Modeling consistency of spatio-temporal graphs
Data & Knowledge Engineering
Hi-index | 0.00 |
A formalization of spatial semantic integrity constraints is fundamental to assess the data quality of spatial databases. This paper presents a formalization of spatial semantic integrity constraints that provides a uniform specification of constraints used in practice. The formalization extends traditional notions of functional and inclusion dependencies to consider spatial attributes. This enables to impose topological relations between spatial attributes and to impose constraints on numerical attributes that depend on spatial attributes. We also study one of the classical problems of integrity constraints: the satisfiability problem, which consists in checking the existence of a non-empty database that satisfies a given set of constraints. This problem, in the context of spatial databases, rises the qualitative reasoning problems of topological consistency and realizability of spatial constraints. We show that satisfiability is not tractable in general and provide some conditions under which it is. For tractable cases, we also give algorithms that check if a set of constraints is satisfiable. For intractable cases we find conditions under which approximation algorithms can be used.