Tuple-Generating Dependencies Capture Complex Values
Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/Gutachten › Beitrag in Konferenzband › Beigetragen › Begutachtung
Beitragende
Abstract
We formalise a variant of Datalog that allows complex values constructed by nesting elements of the input database in sets and tuples. We study its complexity and give a translation into sets of tuple-generating dependencies (TGDs) for which the standard chase terminates on any input database. We identify a fragment for which reasoning is tractable. As membership is undecidable for this fragment, we develop decidable sufficient conditions.
Details
Originalsprache | Englisch |
---|---|
Titel | Proceedings of the 25th International Conference on Database Theory (ICDT 2022) |
Redakteure/-innen | Dan Olteanu, Nils Vortmeier |
Herausgeber (Verlag) | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Seiten | 13:1–13:20 |
Seitenumfang | 20 |
Band | 220 |
ISBN (elektronisch) | 9783959772235 |
ISBN (Print) | 9783959772235 |
Publikationsstatus | Veröffentlicht - 1 März 2022 |
Peer-Review-Status | Ja |
Publikationsreihe
Reihe | 25th International Conference on Database Theory (ICDT 2022) ; Vol. 220 |
---|---|
Band | 220 |
ISSN | 1868-8969 |
Externe IDs
Scopus | 85127929230 |
---|---|
Mendeley | bea557ec-2cfd-3f71-9988-765af623b813 |
dblp | conf/icdt/0001K22 |
Schlagworte
ASJC Scopus Sachgebiete
Schlagwörter
- Datalog, complexity, existential rules, terminating standard chase