Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: computing cores in polynomial time
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange and schema mappings in open and closed worlds
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Static analysis of schema-mappings ensuring oblivious termination
Proceedings of the 13th International Conference on Database Theory
Semantic query optimization in the presence of types
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the termination of the chase algorithm
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Chase termination: a constraints rewriting approach
Proceedings of the VLDB Endowment
Scalable data exchange with functional dependencies
Proceedings of the VLDB Endowment
Relaxed notions of schema mapping equivalence revisited
Proceedings of the 14th International Conference on Database Theory
ACM Transactions on Database Systems (TODS)
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Towards farsighted dependencies for existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
ChaseT: a tool for checking chase termination
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
Chemical knowledge representation with description graphs and logic programming
Proceedings of the 4th International Workshop on Semantic Web Applications and Tools for the Life Sciences
Datalog+/-: a family of languages for ontology querying
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Modelling structured domains using description graphs and logic programming
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
On the complexity of ontological reasoning under disjunctive existential rules
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Theory and Practice of Logic Programming
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Semantic query optimization in the presence of types
Journal of Computer and System Sciences
Description logic knowledge and action bases
Journal of Artificial Intelligence Research
Ontology based query answering with existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Data-Exchange is the problem of creating new databases according to a high-level specification called a schema-mapping while preserving the information encoded in a source database. This paper introduces a notion of generalized schema-mapping that enriches the standard schema-mappings (as defined by Fagin et al) with more expressive power. It then proposes a more general and arguably more intuitive notion of semantics that rely on three criteria: Soundness, Completeness and Laconicity (non-redundancy and minimal size). These semantics are shown to coincide precisely with the notion of cores of universal solutions in the framework of Fagin, Kolaitis and Popa. It is also well-defined and of interest for larger classes of schema-mappings and more expressive source databases (with null-values and equality constraints). After an investigation of the key properties of generalized schema-mappings and their semantics, a criterion called Termination of the Oblivious Chase (TOC) is identified that ensures polynomial data-complexity. This criterion strictly generalizes the previously known criterion of Weak-Acyclicity. To prove the tractability of TOC schema-mappings, a new polynomial time algorithm is provided that, unlike the algorithm of Gottlob and Nash from which it is inspired, does not rely on the syntactic property of Weak-Acyclicity. As the problem of deciding whether a Schema-mapping satisfies the TOC criterion is only recursively enumerable, a more restrictive criterion called Super-weak Acylicity (SwA) is identified that can be decided in Polynomial-time while generalizing substantially the notion of Weak-Acyclicity.