Armstrong's Axioms in Functional Dependency in DBMS

Armstrong’s Axioms in Functional Dependency in DBMS

Difficulty Level : Basic
Last Updated : 17 Sep, 2019

Prerequisite – Functional Dependencies

The term Armstrong axioms refer to the sound and complete set of inference rules or axioms, introduced by William W. Armstrong, that is used to test the logical implication of functional dependencies. If F is a set of functional dependencies then the closure of F, denoted as $F^+$ , is the set of all functional dependencies logically implied by F. Armstrong’s Axioms are a set of rules, that when applied repeatedly, generates a closure of functional dependencies.

Axioms –

Axiom of reflexivity – If $A$ is a set of attributes and $B$ is subset of $C$ , then $C$ holds $B$ . If $B\subseteq A$ then $A\to B$ This property is trivial property.
Axiom of augmentation – If $A\to B$ holds and $Y$ is attribute set, then $AY\to BY$ also holds. That is adding attributes in dependencies, does not change the basic dependencies. If $A\to B$ , then $AC\to BC$ for any $C$ .
Axiom of transitivity – Same as the transitive rule in algebra, if $A\to B$ holds and $B\to C$ holds, then $A\to C$ also holds. $A\to B$ is called as $A$ functionally that determines $B$ . If $X\to Y$ and $Y\to Z$ , then $X\to Z$

Secondary Rules –

These rules can be derived from the above axioms.

Union – If $A\to B$ holds and $A\to C$ holds, then $A\to BC$ holds. If $X\to Y$ and $X\to Z$ then $X\to YZ$
Composition – If $A\to B$ and $X\to Y$ holds, then $AX\to BY$ holds.
Decomposition – If $A\to BC$ holds then $A\to B$ and $A\to C$ hold. If $X\to YZ$ then $X\to Y$ and $X\to Z$
Pseudo Transitivity – If $A\to B$ holds and $BC\to D$ holds, then $AC\to D$ holds. If $X\to Y$ and $YZ\to W$ then $XZ\to W$ .

Why armstrong axioms refer to the Sound and Complete?
By sound, we mean that given a set of functional dependencies F specified on a relation schema R, any dependency that we can infer from F by using the primry rules of amrmstrong axioms holds in every relation state r of R that satisfies the dependencies in F.
By complete, we mean that using primary rules of amrstrong axioms repeatedly to infer dependencies until no more dependencies can be inferred results in the complete set of all possible dependencies that can be inferred from F.

References –
Armstrong’s axioms – Wikipedia
http://tinman.cs.gsu.edu

This article is contributed by Samit Mandal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

My Personal Notes

Related Articles

Axioms –

Secondary Rules –