Semantic foundations of 4NF in relational database design

Vincent, Millist W.

doi:10.1007/s002360050157

Cited by 46 publications

(55 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following result, which was established in [33], [34], shows that, given a set of FDs F, VRFNF is equivalent to BCNF. For the sake of completeness, we provide a sketch of the proof.…”

Section: Definition 41 (Value Redundancy) Let D Be a Database Over Rmentioning

confidence: 94%

“…However, it has proven to be somewhat difficult to formalize the intuitive notion of redundancy and it was only relatively recently that this notion was formalized and its relationship to the classical normal forms was established [33], [34]. This definition of redundancy, and the associated normal form that guarantees redundancy elimination, is as follows.…”

Section: Attribute Redundancymentioning

confidence: 99%

“…In this section, we investigate the conditions under which a database design ensures the elimination of key-based update anomalies (as distinct from other types of update anomalies as investigated in [6], [33]). This concept was originally introduced in [20] to deal with the insertion and deletion of tuples and was later extended in [32], [33] to include the modifications of tuples.…”

Section: Insertion and Modification Anomaliesmentioning

confidence: 99%

“…This concept was originally introduced in [20] to deal with the insertion and deletion of tuples and was later extended in [32], [33] to include the modifications of tuples. A key-based update anomaly is defined to occur when an update to a relation, which can either be an insertion or a deletion or a modification, results in the new relation satisfying key uniqueness, but violating some other constraint on the relation.…”

Section: Insertion and Modification Anomaliesmentioning

confidence: 99%

“…The semantic justification of the normal forms in the presence of FDs is well-understood in terms of eliminating the so-called update anomalies and redundancy problems that can arise in a relation satisfying a set of FDs [6], [20], [9], [33], [34]. The advice that is given as a result of this investigation of the semantics of the normal forms is that, in order to eliminate the above-mentioned problems, we should design database schemas which are in Boyce-Codd Normal Form (BCNF) [12].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Justification for inclusion dependency normal form

Levene

Vincent

2000

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

AbstractÐFunctional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. In this paper, we address the issue of normalization in the presence of FDs and INDs and, in particular, the semantic justification for Inclusion Dependency Normal Form (IDNF), a normal form which combines Boyce-Codd normal form with the restriction on the INDs that they be noncircular and key-based. We motivate and formalize three goals of database design in the presence of FDs and INDs: noninteraction between FDs and INDs, elimination of redundancy and update anomalies, and preservation of entity integrity. We show that, as for FDs, in the presence of INDs being free of redundancy is equivalent to being free of update anomalies. Then, for each of these properties, we derive equivalent syntactic conditions on the database design. Individually, each of these syntactic conditions is weaker than IDNF and the restriction that an FD not be embedded in the righthand side of an IND is common to three of the conditions. However, we also show that, for these three goals of database design to be satisfied simultaneously, IDNF is both a necessary and sufficient condition.Index TermsÐRelational database design, normal forms, functional dependency, inclusion dependency.

show abstract

“…The following result, which was established in [33], [34], shows that, given a set of FDs F, VRFNF is equivalent to BCNF. For the sake of completeness, we provide a sketch of the proof.…”

Section: Definition 41 (Value Redundancy) Let D Be a Database Over Rmentioning

confidence: 94%

Section: Attribute Redundancymentioning

confidence: 99%