23 citations · 64 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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…
cs.DB2017★ 1 cited
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…