The parameterized complexity and kernelization of resilience for database queries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2243367 (Why is no real title available?)
- Complexity results for structure-based causality.
- On generating triangle-free graphs
- On the complexity of sampling query feedback restricted database repair of functional dependency violations
- On the correct translation of update operations on relational views
- Update semantics of relational views
- Updates of Relational Views
Cited in
(7)- On the complexity of resilience for aggregation queries
- Parameterized resiliency problems
- Parameterized complexity of completeness reasoning for conjunctive queries
- The hardness of resilience for nested aggregation query
- Some aspects of the database resilience
- The resilience of conjunctive queries with inequalities
- Parameterized resiliency problems via integer linear programming
This page was built for publication: The parameterized complexity and kernelization of resilience for database queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202009)