Guarded-Based Disjunctive Tuple-Generating Dependencies


We perform an in-depth complexity analysis of query answering under guarded-based classes of disjunctive tuple-generating dependencies (DTGDs), focusing on (unions of) conjunctive queries ((U)CQs). We show that the problem under investigation is very hard, namely 2E<scp>xp</scp>T<scp>ime</scp>-complete, even for fixed sets of dependencies of a very… (More)
DOI: 10.1145/2976736


13 Figures and Tables