The resilience of conjunctive queries with inequalities

DOI10.1016/J.INS.2022.08.049MaRDI QIDQ6205020zbMATH OpenOpenAlexFDO

Authors Biao Qin, Deying Li, Chunlai Zhou

Publication date 11 April 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2022.08.049

zbMATH Keywords

conjunctive queries with inequalitiesresiliencethe vertex cover problem

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• On the complexity of resilience for aggregation queries
• The hardness of resilience for nested aggregation query
• The parameterized complexity and kernelization of resilience for database queries
• Answering conjunctive queries with inequalities
• scientific article; zbMATH DE number 6729737

Cites work

• Causes and explanations in the structural-model approach: Tractable cases
• Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
• Complexity results for structure-based causality.
• From causes for database queries to repairs and model-based diagnosis and back
• scientific article; zbMATH DE number 2080480 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Maximal Flow Through a Network
• On the correct translation of update operations on relational views
• Parameterized complexity of completeness reasoning for conjunctive queries

Cited in

(1)

• Finding smallest witnesses for conjunctive queries

This page was built for publication: The resilience of conjunctive queries with inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205020)