A refined characteristic of minimum contingency set for conjunctive query

DOI10.1007/978-3-319-71150-8_22MaRDI QIDQ1699786zbMATH OpenOpenAlexFDO

Authors Dongjing Miao, Zhipeng Cai

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_22

zbMATH Keywords

complexitydatabaseminimum contigency set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Recommendations

• Conjunctive query containment revisited
• Some results on the containment and minimization of (in)equality queries
• Minimizing restricted-fanout queries
• A trichotomy in the complexity of counting answers to conjunctive queries
• New results on the complexity of deletion propagation

Cited in

(1)

• New results on the complexity of deletion propagation

This page was built for publication: A refined characteristic of minimum contingency set for conjunctive query

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