Uniform Operational Consistent Query Answering

04/22/2022
by   Marco Calautti, et al.
0

Operational consistent query answering (CQA) is a recent framework for CQA, based on revised definitions of repairs and consistent answers, which opens up the possibility of efficient approximations with explicit error guarantees. The main idea is to iteratively apply operations (e.g., fact deletions), starting from an inconsistent database, until we reach a database that is consistent w.r.t. the given set of constraints. This gives us the flexibility of choosing the probability with which we apply an operation, which in turn allows us to calculate the probability of an operational repair, and thus, the probability with which a consistent answer is entailed. A natural way of assigning probabilities to operations is by targeting the uniform probability distribution over a reasonable space such as the set of operational repairs, the set of sequences of operations that lead to an operational repair, and the set of available operations at a certain step of the repairing process. This leads to what we generally call uniform operational CQA. The goal of this work is to perform a data complexity analysis of both exact and approximate uniform operational CQA, focusing on functional dependencies (and subclasses thereof), and conjunctive queries. The main outcome of our analysis (among other positive and negative results), is that uniform operational CQA pushes the efficiency boundaries further by ensuring the existence of efficient approximation schemes in scenarios that go beyond the simple case of primary keys, which seems to be the limit of the classical approach to CQA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

A SAT-based System for Consistent Query Answering

An inconsistent database is a database that violates one or more integri...
research
03/25/2022

A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys

Since 2005, significant progress has been made in the problem of Consist...
research
10/08/2018

Consistent Query Answering for Primary Keys in Logspace

We study the complexity of consistent query answering on databases that ...
research
08/19/2021

Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases

Consistent answers to a query from a possibly inconsistent database are ...
research
01/02/2020

Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing

Data inconsistency evaluating and repairing are major concerns in data q...
research
10/27/2022

Querying Incomplete Numerical Data: Between Certain and Possible Answers

Queries with aggregation and arithmetic operations, as well as incomplet...
research
12/01/2016

Operations in the era of large distributed telescopes

The previous generation of astronomical instruments tended to consist of...

Please sign up or login with your details

Forgot password? Click here to reset