License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2022.13
URN: urn:nbn:de:0030-drops-158876
URL: https://drops.dagstuhl.de/opus/volltexte/2022/15887/
Marx, Maximilian ;
Krötzsch, Markus
Tuple-Generating Dependencies Capture Complex Values
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.
BibTeX - Entry
@InProceedings{marx_et_al:LIPIcs.ICDT.2022.13,
author = {Marx, Maximilian and Kr\"{o}tzsch, Markus},
title = {{Tuple-Generating Dependencies Capture Complex Values}},
booktitle = {25th International Conference on Database Theory (ICDT 2022)},
pages = {13:1--13:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-223-5},
ISSN = {1868-8969},
year = {2022},
volume = {220},
editor = {Olteanu, Dan and Vortmeier, Nils},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15887},
URN = {urn:nbn:de:0030-drops-158876},
doi = {10.4230/LIPIcs.ICDT.2022.13},
annote = {Keywords: terminating standard chase, existential rules, Datalog, complexity}
}
|
Keywords: |
|
terminating standard chase, existential rules, Datalog, complexity |
|
Collection: |
|
25th International Conference on Database Theory (ICDT 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
19.03.2022 |
|
Supplementary Material: |
|
Audiovisual (Video of the Presentation): https://doi.org/10.5446/57489 |
