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 , 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.
- Axiom of reflexivity – If is a set of attributes and is subset of , then holds . If then This property is trivial property.
- Axiom of augmentation – If holds and is attribute set, then also holds. That is adding attributes in dependencies, does not change the basic dependencies. If , then for any .
- Axiom of transitivity – Same as the transitive rule in algebra, if holds and holds, then also holds. is called as functionally that determines . If and , then
Secondary Rules –
These rules can be derived from the above axioms.
- Union – If holds and holds, then holds. If and then
- Composition – If and holds, then holds.
- Decomposition – If holds then and hold. If then and
- Pseudo Transitivity – If holds and holds, then holds. If and then .
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.
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 email@example.com. 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.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Functional Dependency and Attribute Closure
- Multivalued Dependency (MVD) in DBMS
- Canonical Cover of Functional Dependencies in DBMS
- Proving Correctness of Armstrong's Axioms
- Proving Soundness of Armstrong's Axioms
- Lossless Join and Dependency Preserving Decomposition
- Database Management System | Dependency Preserving Decomposition
- Equivalence of Functional Dependencies
- Functional Completeness in Digital Logic
- Finding Additional functional dependencies in a relation
- Allowed Functional Dependencies (FD) in Various Normal Forms (NF)
- Finding the candidate keys for Sub relations using Functional Dependencies
- Finding Attribute Closure and Candidate Keys using Functional Dependencies
- Need for DBMS
- Difference between 1NF and 2NF in DBMS
- Recoverability in DBMS
- Disadvantages of DBMS
- Difference between 2NF and 3NF in DBMS
- Cascadeless in DBMS
- History of DBMS