DeepAI AI Chat
Log In Sign Up

Generalized Deletion Propagation on Counting Conjunctive Query Answers

by   Debmalya Panigrahi, et al.
Duke University

We investigate the computational complexity of minimizing the source side-effect in order to remove a given number of tuples from the output of a conjunctive query. In particular, given a multi-relational database D, a conjunctive query Q, and a positive integer k as input, the goal is to find a minimum subset of input tuples to remove from D that would eliminate at least k output tuples from Q(D). This problem generalizes the well-studied deletion propagation problem in databases. In addition, it encapsulates the notion of intervention for aggregate queries used in data analysis with applications to explaining interesting observations on the output. We show a dichotomy in the complexity of this problem for the class of full conjunctive queries without self-joins by giving a characterization on the structure of Q that makes the problem either polynomial-time solvable or NP-hard. Our proof of this dichotomy result already gives an exact algorithm in the easy cases; we complement this by giving an approximation algorithm for the hard cases of the problem.


page 1

page 2

page 3

page 4


Aggregated Deletion Propagation for Counting Conjunctive Query Answers

We investigate the computational complexity of minimizing the source sid...

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

We study the generalized model counting problem, defined as follows: giv...

Computing Local Sensitivities of Counting Queries with Joins

Local sensitivity of a query Q given a database instance D, i.e. how muc...

A Polynomial Kernel for Funnel Arc Deletion Set

In Directed Feeback Arc Set (DFAS) we search for a set of at most k arcs...

Traceable mixnets

We introduce the notion of traceable mixnets. In a traditional mixnet, m...

The Complexity of Why-Provenance for Datalog Queries

Explaining why a database query result is obtained is an essential task ...

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