Handling inconsistencies in tables with nulls and functional dependencies.
Saved in:
| Title: | Handling inconsistencies in tables with nulls and functional dependencies. |
|---|---|
| Authors: | Laurent, Dominique1 (AUTHOR) dominique.laurent@u-cergy.fr, Spyratos, Nicolas2 (AUTHOR) |
| Source: | Journal of Intelligent Information Systems. Oct2022, Vol. 59 Issue 2, p285-317. 33p. |
| Subjects: | Data quality, Repairing |
| Abstract: | In this paper we address the problem of handling inconsistencies in tables with missing values (also called nulls) and functional dependencies. Although the traditional view is that table instances must respect all functional dependencies imposed on them, it is nevertheless relevant to develop theories about how to handle instances that violate some dependencies. Regarding missing values, we make no assumptions on their existence: a missing value exists only if it is inferred from the functional dependencies of the table. We propose a formal framework in which each tuple of a table is associated with a truth value among the following: true, false, inconsistent or unknown; and we show that our framework can be used to study important problems such as consistent query answering or data quality measures - to mention just two. In this paper, however, we focus mainly on consistent query answering, a problem that has received considerable attention during the last decades. The main contributions of the paper are the following: (a) we introduce a new approach to handle inconsistencies in a table with nulls and functional dependencies, (b) we give algorithms for computing all true, inconsistent and false tuples, and (c) we give a novel solution to the consistent query answering problem and compare our solution to that of table repairs. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Intelligent Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper we address the problem of handling inconsistencies in tables with missing values (also called nulls) and functional dependencies. Although the traditional view is that table instances must respect all functional dependencies imposed on them, it is nevertheless relevant to develop theories about how to handle instances that violate some dependencies. Regarding missing values, we make no assumptions on their existence: a missing value exists only if it is inferred from the functional dependencies of the table. We propose a formal framework in which each tuple of a table is associated with a truth value among the following: true, false, inconsistent or unknown; and we show that our framework can be used to study important problems such as consistent query answering or data quality measures - to mention just two. In this paper, however, we focus mainly on consistent query answering, a problem that has received considerable attention during the last decades. The main contributions of the paper are the following: (a) we introduce a new approach to handle inconsistencies in a table with nulls and functional dependencies, (b) we give algorithms for computing all true, inconsistent and false tuples, and (c) we give a novel solution to the consistent query answering problem and compare our solution to that of table repairs. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09259902 |
| DOI: | 10.1007/s10844-022-00700-0 |
