Artikel in einem Konferenzbericht,

Tuple-Generating Dependencies Capture Complex Values

, und .
Proceedings of the 25th International Conference on Database Theory (ICDT 2022), Volume 220 von 25th International Conference on Database Theory (ICDT 2022) ; Vol. 220, Seite 13:1–13:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (01.03.2022)Publisher Copyright: © Maximilian Marx and Markus Krötzsch;.
DOI: 10.4230/LIPIcs.ICDT.2022.13

Zusammenfassung

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.

Tags

Nutzer

  • @scadsfct

Kommentare und Rezensionen