Scribd
Upload
2 views

Functional_Dependency_Guide

Functional Dependency (FD) describes the relationship between attributes in a relation, indicating how one attribute determines another. There are several types of FDs, including full, partial, transitive, trivial, and non-trivial dependencies, each with implications for database normalization. Understanding these dependencies is crucial for achieving various normal forms, such as 1NF, 2NF, 3NF, and BCNF, which help in organizing database structures efficiently.

Uploaded by

vajid371ak
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Functional_Dependency_Guide

Functional Dependency (FD) describes the relationship between attributes in a relation, indicating how one attribute determines another. There are several types of FDs, including full, partial, transitive, trivial, and non-trivial dependencies, each with implications for database normalization. Understanding these dependencies is crucial for achieving various normal forms, such as 1NF, 2NF, 3NF, and BCNF, which help in organizing database structures efficiently.

Uploaded by

vajid371ak
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Complete Guide to Functional Dependency for GATE DA

1. What is Functional Dependency?


A Functional Dependency (FD) is a relationship between attributes in a relation (table). It
tells us how one attribute (or a set of attributes) determines another attribute.

Mathematical Notation: X → Y

This means Y is functionally dependent on X → If we know the value of X, we can determine


Y uniquely.

StudentID Course Marks

101 DBMS 95

101 ML 90

102 DBMS 85

2. Types of Functional Dependency

Full Functional Dependency


If X → Y, but no proper subset of X determines Y, then Y is fully dependent on X. Necessary
for 3rd Normal Form (3NF).

Partial Dependency
If X → Y, but some proper subset of X also determines Y, then it’s a partial dependency.
Violates 2NF.

Transitive Dependency
If X → Y and Y → Z, then X → Z is called transitive dependency. Violates 3NF.

Trivial Dependency
If Y ⊆ X in X → Y, then it's called trivial dependency.

Non-Trivial Dependency
If Y is NOT a subset of X in X → Y, then it's non-trivial.

3. Functional Dependency Properties (Armstrong’s Axioms)


Reflexivity: If Y ⊆ X, then X → Y.
⊆

✅ Augmentation: If X → Y, then XZ → YZ.

✅ Transitivity: If X → Y and Y → Z, then X → Z.


✅ Union: If X → Y and X → Z, then X → YZ.

✅ Decomposition: If X → YZ, then X → Y and X → Z.

✅ Pseudotransitivity: If X → Y and WY → Z, then WX → Z.

4. Finding Closure of Functional Dependencies


Closure (X⁺) is used to find all attributes that X can determine.

5. Candidate Key & Functional Dependencies


Candidate Key: A minimal set of attributes that determine all other attributes in the relation.

6. Normalization and Functional Dependency


✅ 1NF: Remove duplicate rows.

✅ 2NF: Remove Partial Dependencies.

✅ 3NF: Remove Transitive Dependencies.

✅ BCNF: Every determinant must be a Candidate Key.

You might also like