The parameterized complexity and kernelization of resilience for database queries (Q2202009)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The parameterized complexity and kernelization of resilience for database queries |
scientific article |
Statements
The parameterized complexity and kernelization of resilience for database queries (English)
0 references
17 September 2020
0 references
In this paper, the authors examine the complexity of the resilience decision problem by means of parameterized complexity. It is observed that a triangle query is fixed parameter tractable if the data has the planarity property with respect to the triangle query.
0 references
resilience
0 references
conjunctive query
0 references
parameterized complexity
0 references
