Functional Dependencies in DBMS

⏱ Estimated reading time: 2 min

Functional Dependency (FD) is a fundamental concept in relational database theory used to describe the relationship between attributes in a relation. It forms the basis of normalization, helps in detecting anomalies, and ensures data integrity.

Definition

A functional dependency exists between two sets of attributes X and Y in a relation R if:

➡️ X uniquely determines Y
This is written as:

X → Y

This means:
If two tuples have the same value of X, they must also have the same value of Y.

Example:

StudentID → StudentName
If StudentID is known, the StudentName is uniquely determined.

Types of Functional Dependencies

1️⃣ Trivial Functional Dependency

A dependency is trivial if the right-hand side is a subset of the left-hand side.

Example:

{A, B} → A (Trivial FD)

These dependencies always hold true.

2️⃣ Non-Trivial Functional Dependency

If Y is not a subset of X, then X → Y is non-trivial.

Example:
RollNo → StudentName

3️⃣ Fully Functional Dependency

A non-key attribute is fully functionally dependent on the whole candidate key, not on a part of it.

Example:

In a relation with key (StudentID, CourseID):

(StudentID, CourseID) → Grade
This is a full FD.

4️⃣ Partial Dependency

If a non-key attribute depends only on part of a composite key, it is partial dependency.

Example:

StudentID → StudentName
(from composite key (StudentID, CourseID))

Partial dependencies violate 2NF.

5️⃣ Transitive Dependency

A → B and B → C implies A → C (indirect dependency)

Example:
StudentID → Department
Department → HOD
So, StudentID → HOD (transitive)

Transitive dependencies violate 3NF.

6️⃣ Multivalued Dependency (MVD)

Used in 4NF.
X ↠ Y means Y values are independent of other attributes and multiple values may exist.

Why Functional Dependencies Are Important?

FDs help to:

✔ Design efficient database structures

✔ Remove redundancy

✔ Identify candidate keys

✔ Perform normalization

✔ Avoid anomalies (update, insert, delete)

Example: Functional Dependencies in a Table

Consider a table:

Possible FDs:

• RollNo → Name

• RollNo → Course

• Course → Dept

Using these, we can identify keys and normalize the table.

Armstrong’s Axioms (Rules for FD Inference)

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

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

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

Using these axioms, new FDs can be derived.

Conclusion

Functional Dependencies are crucial in relational database design. They describe how attributes relate to each other, helping detect redundant data, find candidate keys, and guide normalization (1NF to BCNF and beyond). Understanding FDs ensures efficient, consistent, and logically structured databases.