Corpus ID: 206375

A Characterization of the Complexity of Resilience and Responsibility for Conjunctive Queries

  title={A Characterization of the Complexity of Resilience and Responsibility for Conjunctive Queries},
  author={N. Immerman},
Several research thrusts in the area of data management have focused on understanding how changes in the data affect the output of a view or standing query. Example applications are explaining query results, propagating updates through views, and anonymizing datasets. These applications usually rely on understanding how interventions in a database impact the output of a query. An important aspect of this analysis is the problem of deleting a minimum number of tuples from the input tables to… Expand

Figures from this paper

Causality in Databases: Answer-Set Programs and Integrity Constraints
This work summarizes some directions and results of the recent and ongoing research in DB causality, and introduces the notions of a DB tuple as an actual cause for a query result, a contingency set for a cause, and the responsibility of a cause as a numerical measure of its strength. Expand
Causes for query answers from databases: Datalog abduction, view-updates, and integrity constraints
This work establishes precise connections between QA-causality and both abductive diagnosis and the view-update problem in databases, allowing them to obtain new algorithmic and complexity results forQA- Causality. Expand
Query-Answer Causality in Databases and Its Connections with Reverse Reasoning Tasks in Data and Knowledge Management
It is argued that causality in data management can be seen as a very fundamental concept, to which many other data management problems and notions are connected, and suggest causality as a unifying framework for reverseData management problems. Expand
Causes for Query Answers from Databases, Datalog Abduction and View-Updates: The Presence of Integrity Constraints
This work defines and investigates the notion of query-answer causality in the presence of integrity constraints and further investigates connections between query- answer causality and abductive diagnosis and the view-update problem. Expand
Quantifying Causal Effects on Query Answering in Databases
This work revisits the notion of actual causation, introducing and making a case for an alternative measure of causal contribution, that of causal effect, and shows that causal effect provides intuitive and intended results. Expand


The Complexity of Causality and Responsibility for Query Answers and non-Answers
This paper adapts Halpern, Pearl, and Chockler's recent definitions of causality and responsibility to define the causes of answers and non-answers to queries, and their degree of responsibility, and demonstrates a dichotomy between PTIME and NP-complete cases. Expand
A dichotomy in the complexity of deletion propagation with functional dependencies
This paper generalizes a result by Cong et al., stating that deletion propagation is in polynomial time if keys are preserved by the view, and defines a view by a self-join-free conjunctive query (sjf-CQ) over a schema with functional dependencies. Expand
Multi-Tuple Deletion Propagation: Approximations and Complexity
This paper studies the computational complexity of the classic problem of deletion propagation in a relational database, where tuples are deleted from the base relations in order to realize a desiredExpand
A formal approach to finding explanations for database queries
A principled approach to provide explanations for answers to SQL queries based on intervention: removal of tuples from the database that significantly affect the query answers is introduced. Expand
Tracing data errors with view-conditioned causality
This work adapts the definitions of causality and responsibility for the case of multiple answers/views and provides a non-trivial algorithm that reduces the problem of finding causes and their responsibility to a satisfiability problem that can be solved with existing tools. Expand
On propagation of deletions and annotations through views
The two problems correspond to two fundamentally distinct notions of provenance, why and where-provenance, which gives important insights into computational issues involved in data provenance or lineage --- the process by which data moves through databases. Expand
Maximizing conjunctive views in deletion propagation
It is proved that for some other CQs the problem is NP-hard to approximate better than some constant ratio, and it is shown that self joins can have a major negative effect on the approximability of the problem. Expand
On the Complexity of View Update Analysis and Its Application to Annotation Propagation
This paper investigates three problems identified in [1] for annotation propagation, namely, the view side-effect, source side- effect, and annotation placement problems, by considering several dichotomies and shows that key preserving views often simplify the propagation analysis. Expand
How to ConQueR why-not questions
This paper proposes a new paradigm for explaining a why-not question that is based on automatically generating a refined query whose result includes both the original query's result as well as the user-specified missing tuple(s). Expand
Explaining missing answers to SPJUA queries
The algorithms used to generate a correct, finite, and, when possible, minimal set of explanations in queries that include selection, projection, join, union, aggregation and grouping (SPJUA) are described. Expand