{'fraction_non_alphanumeric': 0.017366136034732273, 'fraction_numerical': 0.0, 'mean_word_length': 5.653846153846154, '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}}
Consistent query answering over inconsistent databases

This paper addresses the problem of managing inconsistent databases, that is, databases violating integrity constraints. Most of the works dealing with the problem of extracting reliable information from inconsistent databases are based on the notion of repair, a "minimal" set of update operations which leads the database to a consistent state (called repaired database), and the notion of consistent query answer, a query answer that can be obtained from every repaired database. The problem of computing consistent query answers in the presence of different classes of constraints and under different repair strategies is analyzed.