A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs

10/04/2019
by   Antoine Amarilli, et al.
0

We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two. Our focus is the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries, denoted UCQ^∞ . Our main result states that all unbounded queries in UCQ^∞ are #P-hard for PQE. As bounded queries in UCQ^∞ are already classified by the dichotomy of Dalvi and Suciu [16], our results and theirs imply a complete dichotomy on PQE for UCQ^∞ queries over arity-two signatures. This dichotomy covers in particular all fragments in UCQ^∞ such as negation-free (disjunctive) Datalog, regular path queries, and a large class of ontology-mediated queries on arity-two signatures. Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2022

Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries

We study the uniform query reliability problem, which asks, for a fixed ...
research
03/09/2020

Containment of Simple Regular Path Queries

Testing containment of queries is a fundamental reasoning task in knowle...
research
08/22/2018

The First Order Truth behind Undecidability of Regular Path Queries Determinacy

In our paper [GMO18] we have solved an old problem stated in [CGLV02] sh...
research
12/28/2021

Monads for Measurable Queries in Probabilistic Databases

We consider a bag (multiset) monad on the category of standard Borel spa...
research
12/05/2019

Learning undirected models via query training

Typical amortized inference in variational autoencoders is specialized f...
research
04/01/2019

Boundedness of Conjunctive Regular Path Queries

We study the boundedness problem for unions of conjunctive regular path ...
research
06/07/2020

A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom

Aiming to understand the data complexity of answering conjunctive querie...

Please sign up or login with your details

Forgot password? Click here to reset