Abstract
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
In this paper, we show that an explicit analysis of EGDs can yield significant
benefits and discuss a novel approach along this line
| Original language | English |
|---|---|
| Title of host publication | 24th Italian Symposium on Advanced Database Systems, SEBD 2016, Ugento, Lecce, Italy, June 19-22, 2016, Ugento, Lecce, Italia, June 19-22, 2016. |
| Publisher | Matematicamente.it |
| Pages | 94-101 |
| Number of pages | 8 |
| ISBN (Print) | 9788896354889 |
| Publication status | Published - 22 Jun 2016 |
| Event | 24th Italian Symposium on Advanced Database Systems - Lecce, Italy Duration: 19 Jun 2016 → 22 Jun 2016 |
Conference
| Conference | 24th Italian Symposium on Advanced Database Systems |
|---|---|
| Abbreviated title | SEBD 2016 |
| Country/Territory | Italy |
| City | Lecce |
| Period | 19/06/16 → 22/06/16 |