📘 Canonical Cover (Minimal Cover) in DBMS

Canonical Cover (also called Minimal Cover) is the simplified and optimized set of Functional Dependencies (FDs) which is equivalent to the original set but contains no redundancy.

👉 It represents the same information as the original FD set but in the most compact form.

📌 Formal Definition

A Canonical Cover Fc of a set of functional dependencies F satisfies:

• Every FD has a single attribute on RHS
• No extraneous attribute exists
• No redundant functional dependency exists
• Fc⁺ = F⁺ (closure remains same)

👉 This means Canonical Cover preserves all dependencies but removes unnecessary parts.

🚀 Why Canonical Cover is Important?

Canonical Cover plays a very important role in database design and optimization.

• Normalization: Used in converting relations into 2NF, 3NF, BCNF
• Remove Redundancy: Eliminates duplicate or unnecessary dependencies
• Efficient Design: Makes schema cleaner and easier to understand
• Query Optimization: Reduces complexity while processing queries
• GATE Importance: Frequently asked in 1–2 mark questions

⚙️ Steps to Find Canonical Cover (Step-by-Step)

Step 1: Convert RHS into Single Attribute

If any functional dependency has multiple attributes on RHS, split it into separate FDs.

Example:

A → BC becomes:

• A → B
• A → C

👉 This step ensures uniform structure.

Step 2: Remove Extraneous Attributes

Learn more about Extraneous Attribute

An attribute is extraneous if it can be removed without affecting the closure.

Check in LHS:

If (A,B) → C and A alone can determine C, then B is extraneous.

Check in RHS:

If A → BC and A → B already exists, then C might be extraneous.

👉 Remove such attributes carefully.

Step 3: Remove Redundant Functional Dependencies

Learn more about Redundant Functional Dependency

A functional dependency is redundant if it can be derived from other dependencies.

Example:

If A → B and B → C, then A → C is redundant.

👉 Remove such dependencies to simplify the set.

🧩 Complete Example (GATE Level)

Given FD Set:

• A → BC
• B → C
• A → B

Step 1: Split RHS

• A → B
• A → C
• B → C

Step 2: Check Extraneous Attributes

Learn more about Extraneous Attribute

No extra attributes in LHS here.

Step 3: Remove Redundant FD

Learn more about Redundant FD

A → C is redundant because:

A → B and B → C ⇒ A → C (Transitivity)

✅ Final Canonical Cover:

• A → B
• B → C

💣 Another Example (Important for Exams)

Given:

• AB → C
• A → C

Check Extraneous Attribute

Learn more about Extraneous Attribute

In AB → C, attribute B is extraneous because A alone determines C.

So, AB → C becomes A → C

Final Canonical Cover:

• A → C

⚠️ Common Mistakes (Very Important)

• Forgetting to split RHS
• Removing dependency without checking closure
• Confusing extraneous attribute with redundancy
• Not verifying Fc⁺ = F⁺

🔥 Quick Summary

Concept	Meaning
Canonical Cover	Smallest equivalent FD set
Goal	Remove redundancy
Steps	Split → Remove Extraneous → Remove Redundant
Use	Normalization & GATE

🚀 Continue Learning

👉 Next Topic: Anomalies →

🔗 Related Topics