Characterising Fixed Parameter Tractability for Query Evaluation over Guarded TGDs
Date Issued
2022
Author(s)
Abstract
We consider the parameterized complexity of evaluating Ontology Mediated Queries (OMQ) based on Guarded TGDs (GTGD) and Unions of Conjunctive Queries, in the case where relational symbols have unrestricted arity and where the parameter is the size of the OMQ. We establish exact criteria for fixed-parameter tractable (fpt) evaluation of recursively enumerable (r.e.) classes of such OMQs (under the widely held Exponential Time Hypothesis). One of the main technical tools introduced in the paper is an fpt-reduction from deciding parameterized uniform CSPs to parameterized OMQ evaluation. The reduction preserves measures known to be essential for classifying r.e. classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unrestricted-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas). As such, it can be employed to obtain hardness results for evaluation of r.e. classes of parameterized OMQs based on GTGD both in the unrestricted and in the bounded arity case. Previously, for bounded arity schemas, this has been tackled using a technique requiring full introspection into the construction employed by Grohe.
Subjects
omq
;
fpt evaluation
;
guarded tgds
;
unbounded arity
;
submodular width
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Institution
Type
conference paper
Journal/Edited collection
25th International Conference on Database Theory (ICDT 2022) = Leibniz International Proceedings in Informatics (LIPIcs), Band 220
Start page
12:1
End page
12:20
Secondary publication
Yes
Document version
Published Version
Language
English
File(s)![Thumbnail Image]()
Loading...
Name
Feier_Characterising Fixed Parameter Tractability_2022_published-version.pdf
Size
777.73 KB
Format
Adobe PDF
Checksum
(MD5):84e0dc16553ca899420eedf4f971052e