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
types of repairs: an optimal subset repair (optimal S-repair), which is obtained by a minimum
number of tuple deletions, and an optimal update repair (optimal U-repair), which is
obtained by a minimum number of value (cell) updates. For computing an optimal S-repair,
we present a polynomial-time algorithm that succeeds on certain sets of FDs and fails on …

The work of Benny Kimelfeld and Ester Livshits was supported by the Israel Science
Foundation (ISF) Grant No. 1295/15. The work of Ester Livshits was also supported by the
Technion Hiroshi Fujiwara Cyber Security Research Center and the Israel Cyber Bureau.
The work of Sudeepa Roy was supported by NSF Awards No. IIS-1552538 and No. IIS-
1703431, and NIH Award No. 1R01EB025021-01. Authors' addresses: E. Livshits and B.
Kimelfeld, Computer Science Department, Technion, Haifa 3200003, Israel; emails:{esterliv …