The chase algorithm is a fixpoint algorithm whose aim is to fix inconsistencies of database instances with respect to a set of data dependencies. The chase procedure may be non-terminating and several techniques and criteria for checking chase termination have been proposed. This paper presents ChaseT, a tool that allows users to design data dependencies and apply different criteria and algorithms for checking chase termination. Moreover, ChaseT is able to execute the chase procedure in order to repair the possible inconsistent database provided by the user. This paper starts introducing the chase algorithm and the techniques for checking chase termination and then focuses on the architecture and the use-case scenarios of ChaseT.
ChaseT: A tool for checking chase termination
DE FRANCESCO, ANDREA;Trubitsyna, Irina
2011-01-01
Abstract
The chase algorithm is a fixpoint algorithm whose aim is to fix inconsistencies of database instances with respect to a set of data dependencies. The chase procedure may be non-terminating and several techniques and criteria for checking chase termination have been proposed. This paper presents ChaseT, a tool that allows users to design data dependencies and apply different criteria and algorithms for checking chase termination. Moreover, ChaseT is able to execute the chase procedure in order to repair the possible inconsistent database provided by the user. This paper starts introducing the chase algorithm and the techniques for checking chase termination and then focuses on the architecture and the use-case scenarios of ChaseT.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
