Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
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
Chase termination: a constraints rewriting approach
Proceedings of the VLDB Endowment
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.00 |
Consistency problems arise in many fundamental database applications as data exchange, data integration, data warehouse and many others. The chase algorithm is a fundamental and useful tool fixing inconsistencies of database instances with respect to a set of data dependencies. It is well known that the chase algorithm may be nonterminating and several techniques and criteria for checking chase termination have been recently proposed. This paper presents ChaseT, a tool that allows users to design data dependencies and combine different criteria and rewriting algorithms for checking chase termination.