pith. sign in

arxiv: 1904.03403 · v1 · pith:AD3EB6J4new · submitted 2019-04-06 · 💻 cs.DB

Inconsistency Measures for Relational Databases

classification 💻 cs.DB
keywords inconsistencymeasuresconstraintsdatabasedatabasesintroduceknowledgethen
0
0 comments X
read the original abstract

In this paper, building on work done on measuring inconsistency in knowledge bases, we introduce inconsistency measures for databases. In particular, focusing on databases with denial constraints, we first consider the natural approach of virtually transforming a database into a propositional knowledge base and then applying well-known measures. However, using this method, tuples and constraints are equally considered in charge of inconsistencies. Then, we introduce a version of inconsistency measures blaming database tuples only, i.e., treating integrity constraints as irrefutable statements. We analyze the compliance of database inconsistency measures with standard rationality postulates and find interesting relationships between measures. Finally, we investigate the complexity of the inconsistency measurement problem as well as of the problems of deciding whether the inconsistency is lower than, greater than, or equal to a given threshold.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Measuring Database Unfairness via Dependency Quantification Under Differential Privacy

    cs.DB 2026-05 unverdicted novelty 5.0

    Proposes a formal DP-compatible framework with three unfairness measures (mutual information with TV proxy, MaxSAT-based repair, top-k tuple contribution) that satisfy positivity, monotonicity, and computability.