All Exams Test series for 1 year @ ₹349 only
Question

Which of the following DBMS scenarios will NOT really follow Armstrong's Axiom?

The correct answer is
Pseudo transitivity rule

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:

  • Reflexivity rule: If \(X \supseteq Y\), then \(X \to Y\). This is a fundamental rule and always holds true. A superkey always functionally determines any subset of its attributes.
  • Pseudo transitivity rule: If \(X \to Y\) and \(YW \to Z\), then \(XW \to Z\). This axiom is *not always* strictly followed in real-world DBMS scenarios. While it's a helpful inference rule, situations may exist (e.g., complex data relationships, data inconsistencies) where this rule doesn't perfectly hold. This is because of practical limitations of real-world databases.
  • Transitivity rule: If \(X \to Y\) and \(Y \to Z\), then \(X \to Z\). This rule is a core part of Armstrong's axioms and is generally followed in properly designed DBMS systems.
  • Armstrong's axioms: This refers to the set of axioms as a whole and would naturally encompass situations where the pseudo-transitivity rule may not hold in certain specific cases. It does not constitute a single scenario violating the set of rules.

Step-by-step Logic:

  1. Understanding Armstrong's Axioms: The question tests knowledge of how Armstrong's axioms function in practice within a DBMS.
  2. Analyzing each option: We need to evaluate each option's likelihood of not adhering to the rules in real-world scenarios.
  3. Identifying the exception: The pseudo-transitivity rule, while theoretically sound, can be challenged by practical database complexities. Data anomalies or poorly designed schemas could lead to scenarios where this specific rule is not perfectly mirrored in the database's behavior.

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

Was this answer helpful?

Important Questions from Functional Dependency - Teaching

  1. 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

  2. In a database, a rule is defined as (P1 and P2) or P3? R1 (0.8) and R2 (0.3), where P1, P2, P3 are premises and R1. R2 are conclusions of rules with certainty factors (CF) 0.8 and 0.3 respectively. If any running program has produced P1, P2, P3 with CF as 0.5, 0.8. 0.2 respectively, find the CF of results on the basis of premises.

  3. Minimal cover F’ of functional dependency set F is

  4. 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?
  5. Identify the redundant functional dependency in F

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App