Uniform reliability of self-join-free conjunctive queries

DOI10.4230/LIPICS.ICDT.2021.17MaRDI QIDQ7229590zbMATH OpenFDO

Authors Antoine Amarilli, Benny Kimelfeld

Publication date 16 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2021.17

zbMATH Keywords

\#P-hardnesscounting problemshierarchical conjunctive queriesquery reliabilitytuple-independent database

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A dichotomy in the complexity of counting database repairs
• Mathematical Properties of the Banzhaf Power Index
• Probabilistic databases
• Stochastic Games
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The complexity of the counting constraint satisfaction problem
• The dichotomy of probabilistic inference for unions of conjunctive queries

This page was built for publication: Uniform reliability of self-join-free conjunctive queries

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