23 citations · 64 across the 9 of their papers we have counts for
16 papers
Optimal Repairs for Unary Functional Dependencies: Resolving the Case of Updates
Benny Kimelfeld, Ester Livshits
If a table violates its required set of functional dependencies (FDs), what is the minimum number of cell changes needed to restore consistency? This fundamental problem, known as…
Analyzing Deviations from Monotonic Trends through Database Repair
Shunit Agmon, Jonathan Gal, Amir Gilad +4
Datasets often exhibit violations of expected monotonic trends - for example, higher education level correlating with higher average salary, newer homes being more expensive, or di…
Repairing Databases over Metric Spaces with Coincidence Constraints
Youri Kaminsky, Benny Kimelfeld, Ester Livshits +2
Datasets often contain values that naturally reside in a metric space: numbers, strings, geographical locations, machine-learned embeddings in a Euclidean space, and so on. We stud…
The Shapley Value in Database Management
Leopoldo Bertossi, Benny Kimelfeld, Ester Livshits +1
Attribution scores can be applied in data management to quantify the contribution of individual items to conclusions from the data, as part of the explanation of what led to these…
The Complexity of Why-Provenance for Datalog Queries
Marco Calautti, Ester Livshits, Andreas Pieris +1
Explaining why a database query result is obtained is an essential task towards the goal of Explainable AI, especially nowadays where expressive database query languages such as Da…
Uniform Operational Consistent Query Answering
Marco Calautti, Ester Livshits, Andreas Pieris +1
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 effici…
Exact and Approximate Counting of Database Repairs
Marco Calautti, Ester Livshits, Andreas Pieris +1
A key task in the context of consistent query answering is to count the number of repairs that entail the query, with the ultimate goal being a precise data complexity classificati…
Database Repairing with Soft Functional Dependencies
Nofar Carmeli, Martin Grohe, Benny Kimelfeld +2
A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computationa…
The Shapley Value of Inconsistency Measures for Functional Dependencies
Ester Livshits, Benny Kimelfeld
Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data cleaning. Another goal i…
Approximate Denial Constraints
Ester Livshits, Alireza Heidari, Ihab F. Ilyas +1
The problem of mining integrity constraints from data has been extensively studied over the past two decades for commonly used types of constraints including the classic Functional…
The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries
Alon Reshef, Benny Kimelfeld, Ester Livshits
The Shapley value is a conventional and well-studied function for determining the contribution of a player to the coalition in a cooperative game. Among its applications in a pleth…
The Shapley Value of Tuples in Query Answering
Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld +1
We investigate the application of the Shapley value to quantifying the contribution of a tuple to a query answer. The Shapley value is a widely known numerical measure in cooperati…
Properties of Inconsistency Measures for Databases
Ester Livshits, Rina Kochirgan, Segev Tsur +3
How should we quantify the inconsistency of a database that violates integrity constraints? Proper measures are important for various tasks, such as progress indication and action…
Computing Optimal Repairs for Functional Dependencies
Ester Livshits, Benny Kimelfeld, Sudeepa Roy
We investigate the complexity of computing an optimal repair of an inconsistent database, in the case where integrity constraints are Functional Dependencies (FDs). We focus on two…
The Complexity of Computing a Cardinality Repair for Functional Dependencies
Ester Livshits, Benny Kimelfeld
For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a "cardinality re…
Unambiguous Prioritized Repairing of Databases
Benny Kimelfeld, Ester Livshits, Liat Peterfreund
In its traditional definition, a repair of an inconsistent database is a consistent database that differs from the inconsistent one in a "minimal way". Often, repairs are not equal…