DeepAI AI Chat
Log In Sign Up

Towards a Dichotomy for Minimally Factorizing the Provenance of Self-Join Free Conjunctive Queries

by   Neha Makhija, et al.

We consider the problem of finding the minimal-size factorization of the provenance of self-join-free conjunctive queries, i.e., we want to find an equivalent propositional formula that minimizes the number of variable occurrences. Our work is partly motivated from probabilistic inference where read-once formulas are known to allow exact PTIME solutions and non-read-once formulas allow approximate solutions with an error that depends on the number of repetitions of variables. We embark on the challenge of characterizing the data complexity of this problem and show its connection to the query resilience problem. While the problem is NP-complete in general, we develop an encoding as max-flow problem that is guaranteed to give the exact solution for several queries (and otherwise approximate minimizations). We show that our encoding is guaranteed to return a read-once factorization if it exists. Our problem and approach is a complete solution that naturally recovers exact solutions for all known PTIME cases, as well as identifying additional queries for which the problem can be solved in PTIME.


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...

Discovering Dichotomies for Problems in Database Theory

Dichotomy theorems, which characterize the conditions under which a prob...

Downward Self-Reducibility in TFNP

A problem is downward self-reducible if it can be solved efficiently giv...

Counting Database Repairs Entailing a Query: The Case of Functional Dependencies

A key task in the context of consistent query answering is to count the ...

A More General Theory of Static Approximations for Conjunctive Queries

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable ...

Square-Cut Pizza Sharing is PPA-complete

We study the computational complexity of computing solutions for the squ...