Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries

09/22/2022
by   Antoine Amarilli, et al.
0

We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restricted case of Boolean query evaluation on tuple-independent probabilistic databases where all facts must have probability 1/2. We focus on graph signatures, and on queries closed under homomorphisms. We show that for any such query that is unbounded, i.e., not equivalent to a union of conjunctive queries, the uniform reliability problem is #P-hard. This recaptures the hardness, e.g., of s-t connectedness, which counts how many subgraphs of an input graph have a path between a source and a sink. This new hardness result on uniform reliability strengthens our earlier hardness result on probabilistic query evaluation for unbounded homomorphism-closed queries (ICDT'20). Indeed, our earlier proof crucially used facts with probability 1, so it did not apply to the unweighted case. The new proof presented in this paper avoids this; it uses our recent hardness result on uniform reliability for non-hierarchical conjunctive queries without self-joins (ICDT'21), along with new techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2019

A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs

We study the problem of probabilistic query evaluation (PQE) over probab...
research
08/03/2020

A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries

We study the generalized model counting problem, defined as follows: giv...
research
08/19/2019

Model Counting for Conjunctive Queries Without Self-Joins

We study the problem of model counting for Boolean Conjunctive Queries (...
research
01/27/2022

Probabilistic Query Evaluation with Bag Semantics

We initiate the study of probabilistic query evaluation under bag semant...
research
07/02/2019

New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins

The resilience of a Boolean query is the minimum number of tuples that n...
research
10/09/2018

Uniform CSP Parameterized by Solution Size is in W[1]

We show that the uniform Constraint Satisfaction Problem (CSP) parameter...
research
08/09/2022

Consecutive k-out-of-n:F Systems Have Unbounded Roots

This article is studying the roots of the reliability polynomials of lin...

Please sign up or login with your details

Forgot password? Click here to reset