ChaseT: A tool for checking chase termination

Andrea De Francesco, Sergio Greco, Francesca Spezzano, Irina Trubitsyna

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 non-terminating 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.

Original languageEnglish
Title of host publicationScalable Uncertainty Management - 5th International Conference, SUM 2011, Proceedings
Pages520-524
Number of pages5
DOIs
StatePublished - 2011
Event5th International Conference on Scalable Uncertainty Management, SUM 2011 - Dayton, OH, United States
Duration: 10 Oct 201113 Oct 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6929 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Scalable Uncertainty Management, SUM 2011
Country/TerritoryUnited States
CityDayton, OH
Period10/10/1113/10/11

Fingerprint

Dive into the research topics of 'ChaseT: A tool for checking chase termination'. Together they form a unique fingerprint.

Cite this