Journal of Logic Programming
Horn clauses and database dependencies
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
The complexity of data exchange
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Consistent query answering in databases
ACM SIGMOD Record
On reconciling data exchange, data integration, and peer data management
Proceedings of the twenty-sixth 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
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
On the termination of the chase algorithm
RR'10 Proceedings of the Fourth 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
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
Semantic query optimization in the presence of types
Journal of Computer and System Sciences
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm solves such violations by inserting tuples and setting the value of nulls. Unfortunately, the chase algorithm may not terminate and the problem of deciding whether the chase process terminates is undecidable. Recently there has been an increasing interest in the identification of sufficient structural properties of constraints which guarantee that the chase algorithm terminates [8, 10, 14, 15]. In this paper we propose an original technique which allows to improve current conditions detecting chase termination. Our proposal consists in rewriting the original set of constraints Σ into an 'equivalent' set Σα and verifying the structural properties for chase termination on Σα. The rewriting of constraints allows to recognize larger classes of constraints for which chase termination is guaranteed. In particular, we show that if Σ satisfies chase termination conditions T, then the rewritten set Σα satisfies T as well, but the vice versa is not true, that is there are significant classes of constraints for which Σα satisfies T and Σ does not.