The Complexity of Causality and Responsibility for Query Answers and non-Answers

@article{Meliou2010TheCO,
  title={The Complexity of Causality and Responsibility for Query Answers and non-Answers},
  author={Alexandra Meliou and Wolfgang Gatterbauer and Katherine F. Moore and Dan Suciu},
  journal={ArXiv},
  year={2010},
  volume={abs/1009.2021}
}
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to compute the lineage of a non-answer to a query. However, the cause of an answer or non-answer is a more subtle notion and consists, in general, of only a fragment of the lineage. In this paper, we adapt Halpern, Pearl, and Chockler's recent definitions of causality and responsibility to define the causes of answers and non… Expand
Efficiently Computing Provenance Graphs for Queries with Negation
TLDR
This work presents the first practical approach for answering why and why-not provenance questions for queries with negation (first-order queries) and significantly outperforms an earlier approach which instantiates the full provenance to compute explanations. Expand
A SQL-Middleware Unifying Why and Why-Not Provenance for First-Order Queries
TLDR
This work presents the first practical approach for answering why and why-not provenance questions for queries with negation (firstorder queries) and significantly outperforms an earlier approach which instantiates the full provenance to compute explanations. Expand
Efficient Responsibility Analysis for Query Answers
TLDR
This work extends the definitions of causality and responsibility of a tuple t for the answer r to those of a set of tuples for theanswer r, and Co-Trees to P-T trees for read-once functions, and develops an efficient algorithm to compute responsibilities of tupled in read- once formulas and a novel algorithm to find top-k responsibility tuples in read -once functions. Expand
Towards Constraint-based Explanations for Answers and Non-Answers
TLDR
It is argued that logical constraints as a concise description of large (or even infinite) sets of existing or missing inputs can provide a natural way of answering a why- or why-not provenance question. Expand
Causality and Responsibility Problem on Probabilistic Reverse Skyline Queries
TLDR
This paper proposes an efficient algorithm termed as CP to compute the causality and responsibility for the non-answers to PRSQ, and first finds candidate causes, and then, it performs verification to obtain actual causes with their responsibilities. Expand
Query-Answer Causality in Databases and Its Connections with Reverse Reasoning Tasks in Data and Knowledge Management
TLDR
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
A Characterization of the Complexity of Resilience and Responsibility for Conjunctive Queries
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 queryExpand
Causality in Databases, Database Repairs, and Consistency-Based Diagnosis (extended abstract)
TLDR
C causality is a more refined notion that identifies causes for query results on the basis of user-defined criteria, and ranks causes according to their responsibility [20]. Expand
PUG: a framework and practical implementation for why and why-not provenance
TLDR
This work introduces a graph-based provenance model that, while syntactic in nature, supports reverse reasoning and is proven to encode a wide range of provenance models from the literature. Expand
Tracing data errors with view-conditioned causality
TLDR
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
WHY SO? or WHY NO? Functional Causality for Explaining Query Answers
TLDR
C causality as a unified framework to explain query answers and non-answers, thus generalizing and extending several previously proposed approaches of provenance and missing query result explanations. Expand
The complexity of causality and responsibility for query answers and non-answers
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to compute the lineage of a...
Complexity results for structure-based causality
We give a precise picture of the computational complexity of causal relationships in Pearl's structural models, where we focus on causality between variables, event causality, and probabilisticExpand
On the provenance of non-answers to queries over extracted data
TLDR
This work focuses on providing provenance-style explanations for non-answers and develops a mechanism for providing this new type of provenance and suggests that this approach can provide effective provenance information that can help a user resolve their doubts over non-ANSwers to a query. Expand
How to ConQueR why-not questions
TLDR
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
Secondary-storage confidence computation for conjunctive queries with inequalities
TLDR
This paper investigates the problem of efficiently computing the confidences of distinct tuples in the answers to conjunctive queries with inequalities (<) on tuple-independent probabilistic databases, and introduces a confidence computation technique based on efficient compilation of the lineage of the query answer into Ordered Binary Decision Diagrams (OBDDs). Expand
The complexity of acyclic conjunctive queries
TLDR
This paper shows that the problem of evaluating acyclic Boolean conjunctive queries is complete for LOGCFL, the class of decision problems that are logspace-reducible to a context-free language, and that the acYclic versions of the following well-known database andAI problems are allLOGCFL-complete. Expand
Causality in Databases
TLDR
A discussion on causality in databases is initiated, some simple definitions are given, and this formalism is motivated through a number of example applications. Expand
Causes and explanations in the structural-model approach: Tractable cases
TLDR
This paper explores how an instance of deciding weak cause can be reduced to an equivalent instance in which irrelevant variables in the (potential) weak cause and the causal model are removed, and presents a new characterization of weak cause for a certain class of causal models in which the causal graph over the endogenous variables has the form of a directed chain of causal subgraphs, called decomposable causal graph. Expand
Why and Where: A Characterization of Data Provenance
TLDR
An approach to computing provenance when the data of interest has been created by a database query is described, adopting a syntactic approach and present results for a general data model that applies to relational databases as well as to hierarchical data such as XML. Expand
...
1
2
3
4
...