Name
Abstract | ||
|---|---|---|
How should a cleaning system measure the amount of inconsistency in the database? Proper measures are important for quantifying the progress made in the cleaning process relative to the remaining effort and resources required. Similarly to effective progress bars in interactive systems, inconsistency should ideally diminish steadily and continuously while aiming to avoid jitters and jumps. Moreover, measures should be computationally tractable towards online applicability. Building on past research on inconsistency measures for knowledge bases, we embark on a systematic investigation of the rationality postulates of inconsistency measures in the context of database repairing systems. Such postulates should take into consideration the interplay between the database tuples, the integrity constraints, and the space of atomic repairing operations. We shed light on classic measures by examining them against a set of rationality postulates, and propose a measure that is both rationale and tractable for the general class of denial constraints. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Databases | Journal |
Volume | Citations | PageRank |
abs/1904.06492 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ester Livshits | 1 | 2 | 1.71 |
| Ihab F. Ilyas | 2 | 2907 | 117.27 |
| Benny Kimelfeld | 3 | 1034 | 71.63 |
| Sudeepa Roy | 4 | 268 | 30.95 |