Prerequisite – Functional Dependencies
This article contains Armstrong’s Axioms and how Armstrong’s Axioms are used to decide about the functional dependency on the database. We will be also learning about the Secondary Rules and Armstrong Relations. We will learn each thing in detail. Before moving ahead, you must have a knowledge of Functional Dependency.
The term Armstrong Axioms refers 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.
- Axiom of Reflexivity: If A is a set of attributes and B is a subset of A, then A holds B. If B⊆A then A→B. This property is trivial property.
- Axiom of Augmentation: If A→B holds and Y is the attribute set, then AY→BY also holds. That is adding attributes to dependencies, does not change the basic dependencies. If A→B, then AC→BC for any C.
- Axiom of Transitivity: Same as the transitive rule in algebra, if A→B holds and B→C holds, then A→C also holds. A→B is called A functionally which determines B. If X→Y and Y→Z, then X→Z.
These rules can be derived from the above axioms.
- Union: If A→B holds and A→C holds, then A→BC holds. If X→Y and X→Z then X→YZ.
- Composition: If A→B and X→Y hold, then AX→BY holds.
- Decomposition: If A→BC holds then A→B and A→C hold. If X→YZ then X→Y and X→Z.
- Pseudo Transitivity: If A→B holds and BC→D holds, then AC→D holds. If X→Y and YZ→W then XZ→W.
- Self Determination: It is similar to the Axiom of Reflexivity, i.e. A→A for any A.
- Extensivity: Extensivity is a case of augmentation. If AC→A, and A→B, then AC→B. Similarly, AC→ABC and ABC→BC. This leads to AC→BC.
Armstrong Relation can be stated as a relation that is able to satisfy all functional dependencies in the F+ Closure. In the given set of dependencies, the size of the minimum Armstrong Relation is an exponential function of the number of attributes present in the dependency under consideration.
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 primary rules of Armstrong axioms holds in every relation state r of R that satisfies the dependencies in F.
By complete, we mean that using primary rules of Armstrong 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.
Advantages of Using Armstrong’s Axioms in Functional Dependency
- They provide a systematic and efficient method for inferring additional functional dependencies from a given set of functional dependencies, which can help to optimize database design.
- They can be used to identify redundant functional dependencies, which can help to eliminate unnecessary data and improve database performance.
- They can be used to verify whether a set of functional dependencies is a minimal cover, which is a set of dependencies that cannot be further reduced without losing information.
Disadvantages of Using Armstrong’s Axioms in Functional Dependency
- The process of using Armstrong’s axioms to infer additional functional dependencies can be computationally expensive, especially for large databases with many tables and relationships.
- The axioms do not take into account the semantic meaning of data, and may not always accurately reflect the relationships between data elements.
- The axioms can result in a large number of inferred functional dependencies, which can be difficult to manage and maintain over time.
FAQs on Armstrong Axioms
1. List the primary rules of Armstrong Axioms?
The primary rules of the Armstrong Axioms are:
2. When do we use Armstrong Axioms?
We use Armstrong Axioms to determine the functional dependency in the database. Generally, it is used to derive other functional dependency in the database using the given functional dependency.
3. What do you mean by sound in Armstrong Axioms?
By Sound, we simply mean that those set of functional dependency F that we can relate from F to a relation schema R using the primary rules of Axioms in each relation r that satisfy the dependency of F.
Level Up Your GATE Prep!
Embark on a transformative journey towards GATE success by choosing Data Science & AI
as your second paper choice with our specialized course. If you find yourself lost in the vast landscape of the GATE syllabus, our program is the compass you need.