Leveraging Equality Generating Dependencies for Chase Termination

Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

Tuple- and equality-generating dependencies have a wide range of applications in knowledge representation and databases, including ontological reasoning, data exchange, and data cleaning. In such settings, the chase is a central tool for many reasoning tasks. Since the chase evaluation might not terminate and it is undecidable whether it terminates, several termination criteria have been proposed, that is, (decidable) su!cient conditions ensuring termination. One of the main weaknesses of current approaches is the limited analysis they perform on equality-generating dependencies (EGDs).
In this paper, we show that an explicit analysis of EGDs can yield significant
benefits and discuss a novel approach along this line
Original languageEnglish
Title of host publication24th Italian Symposium on Advanced Database Systems, SEBD 2016, Ugento, Lecce, Italy, June 19-22, 2016, Ugento, Lecce, Italia, June 19-22, 2016.
PublisherMatematicamente.it
Pages94-101
Number of pages8
ISBN (Print)9788896354889
Publication statusPublished - 22 Jun 2016
Event24th Italian Symposium on Advanced Database Systems - Lecce, Italy
Duration: 19 Jun 201622 Jun 2016

Conference

Conference24th Italian Symposium on Advanced Database Systems
Abbreviated titleSEBD 2016
Country/TerritoryItaly
CityLecce
Period19/06/1622/06/16

Fingerprint

Dive into the research topics of 'Leveraging Equality Generating Dependencies for Chase Termination'. Together they form a unique fingerprint.

Cite this