Dependency Preserving Decomposition

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/database-management-systemdbms/decomposition-properties-4nf/dependency-preserving-decomposition/asset-dependency-preserving-decomposition after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the concept of Dependency Preserving Decomposition in database normalization. The instructor begins by defining the condition for a decomposition to be dependency preserving using set notation. He then applies this definition to a specific example involving a relation R(A, B, C) and its decomposition into R1(A, B) and R2(B, C). The lecture involves analyzing functional dependencies and verifying if the original dependencies can be derived from the dependencies of the decomposed relations. The instructor emphasizes that while this property is desirable, it is not always guaranteed in all decompositions, particularly in BCNF.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic "Dependency Preserving Decomposition" with a slide defining the condition. The slide states: "Let relation R be decomposed into Relations R1, R2... RN with their respective functional Dependencies set as F1, F2... FN then the Decomposition is Dependency Preserving iff {F1 U F2 U F3 U F4... U FN}+ = F+". The instructor explains this formula, emphasizing that the closure of the union of the projected dependencies must equal the closure of the original set of functional dependencies. He circles the formula on the slide to highlight its importance. He mentions that while this property is desirable, it is not always guaranteed in all decompositions, specifically mentioning that it might not be preserved in some cases like BCNF decomposition. He underlines the term "Dependency Preserving" and the formula to ensure students focus on the core definition.

  2. 2:00 – 4:20 02:00-04:20

    The instructor moves to a practical example. He writes "R (A, B, C)" and lists the functional dependencies: "A->B, B->C, C->A". He proposes a decomposition into "R1(A, B) AND R2(B, C)". He draws a tree diagram showing R decomposing into R1 and R2. He writes the condition "(F1 U F2)+ = F+" on the board. He then analyzes the dependencies for each relation. Under R1, he writes "A->B" and "B->A". Under R2, he writes "B->C" and "C->B". He circles these derived dependencies and crosses out the original dependencies to show the comparison. He explains that since the original dependencies (like C->A) can be derived from the union of the new dependencies (C->B and B->A), the decomposition preserves dependencies. He emphasizes that checking the closure is the standard method to verify this property. He notes that if the closure of the union of F1 and F2 equals the closure of F, then the decomposition is dependency preserving.

The lesson progresses from theoretical definition to practical application. The instructor first establishes the mathematical condition for dependency preservation using set closure notation. He then transitions to a concrete example with three attributes and three functional dependencies. By decomposing the relation and analyzing the projected dependencies on the sub-relations, he demonstrates how to verify if the original constraints are maintained. The key takeaway is that a decomposition is dependency preserving if the union of the functional dependencies of the decomposed relations can logically imply all the original functional dependencies. This ensures that integrity constraints can be checked without joining the relations, which is a crucial performance consideration in database design. The instructor's method of writing out the dependencies and crossing them out helps visualize the verification process clearly for students.

Loading lesson…