activity
20162024
most citedThe Complexity of Computing a Cardinality Repair for Functional Dependencies

1 citations · 1 across the 2 of their papers we have counts for

collaborators

8 papers

cs.DB2022

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…

cs.DB2020

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…

cs.DB2020

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…

cs.DB2019

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…

cs.DB2019

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…

cs.DB2017

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…