Tuple-Generating Dependencies Capture Complex Values

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Tuple-Generating Dependencies Capture Complex Values

Vortrag von Maximilian Marx
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.

The talk is about an accepted paper with Markus in ICDT 2022.

Link to the online talk: