{'fraction_non_alphanumeric': 0.015795868772782502, 'fraction_numerical': 0.0, 'mean_word_length': 5.338461538461538, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fixing inconsistent databases by updating numerical attributes

For several reasons a database may not satisfy certain integrity constraints (ICs). However most likely most of the information in it is still consistent with the ICs; and could be retrieved when queries are answered. Consistent answers with respect to a set of ICs have been characterized as answers that can be obtained from every possible minimal repair of the database, where the repairs are obtained by deletions/insertion of whole tuples. In this paper we study the problem of fixing (repairing) databases by updating numerical attributes of tuples with respect to denial constraints. We introduce a quantitative definition of database fix, identify relevant tractable cases and introduce approximation algorithms for some of those that are intractable.