Question Type: Database Management Systems (DBMS) - Armstrong's Axioms
Armstrong's axioms are a set of inference rules used in relational database theory to derive functional dependencies. They form the basis for determining the minimal set of functional dependencies that can define a relation. Let's examine each option:
Step-by-step Logic:
Why other options are incorrect: The reflexivity and transitivity rules are fundamental and are almost always obeyed in database systems. Selecting "Armstrong's axioms" is incorrect because it refers to the entire set, not a specific scenario that violates them.
Core Logic/Pattern: The core logic is understanding that while Armstrong's axioms provide a theoretical foundation for functional dependencies, practical implementations of DBMS might not always perfectly adhere to the pseudo-transitivity rule due to the complexities of real-world data.
Correct Answer: Pseudo transitivity rule
Let R (ABCDEFGH) be a relation schema and F be the set of dependencies F = {A → B, ABCD → E, EF → G, EF → H and ACDF →EG}. The minimal cover of a set of functional dependencies is
Minimal cover F’ of functional dependency set F is
Assume that given table R is decomposed in two tables
R 1(A, B, C) with functional dependency set f 1= {A → B, A → C} and R 2(A, D, E) with FD set F 2= {A → D, D → E}
Which of the following option is true w.r.t. given decomposition?Identify the redundant functional dependency in F
Identify primary key of table R with functional dependency set F