Maintaining consistency of imprecise relations

Levene, Mark (1996) Maintaining consistency of imprecise relations. The Computer Journal 39 (2), pp. 114-123. ISSN 0010-4620.

Full text not available from this repository.

Official URL: https://doi.org/10.1093/comjnl/39.2.114

Abstract

We extend functional dependencies (FDs), which are the most fundamental integrity constraints that arise in practice in relational databases, to be satisfied in an imprecise relation. The problem we tackle is the following: given an imprecise relation r over a relation schema R and a set of FDs F over R, what is the most precise approximation of r, which is also consistent with respect to F. We formalize the notion of an imprecise relation by defining tuple values to be sets of values rather than just single values as is the case when the information is precise. We interpret each value in such a set as being equally likely to be the true value. This gives rise to equivalence classes of equally likely values thus allowing us to define the merge of an imprecise relation r which replaces values in r by their equivalence class. We also define a partial order on merged imprecise relations leading to the notion of an imprecise relation being less precise than another imprecise relation. This partial order induces a lattice on the set of merged imprecise relations. An imprecise relation is consistent with respect is consistent with respect to a set of FDs F if it satisfies F. Satisfaction of an FD in an imprecise relation is defined in terms of values being equally likely rather than equal. We show that Armstrong's axiom system is sound and complete for FDs being satisfied in imprecise relations. We redefine the chase procedure for an imprecise relation r over R as a means of maintaining consistency of r with respect to F. Our main results is that the output chase (r,F) of the chase procedure is the most precise approximation of r with respect to F in the following sense. It is shown to be the join of all consistent imprecise relations s with respect to F in the following sense. It is shown to be the join of all consistent imprecise relations s such that s is a merged imprecise relation that is less precise than r. It is also shown that chase (r,F) can be computed in polynomial time in the sizes of r and F.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	08 Jun 2021 10:44
Last Modified:	09 Aug 2023 12:51
URI:	https://eprints.bbk.ac.uk/id/eprint/44653

Statistics

Archive Staff Only (login required)

Edit/View Item