Dependency Preserving Decomposition

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-07-database-management-systems/decomposition-properties-4nf/dependency-preserving-decomposition/asset-dependency-preserving-decomposition after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors, Factors, Multiples, Divisibility, HCF & LCM, Mensuration — Perimeter, Area, Surface Area, Volume, Data Handling, Graphs & Probability, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms, समतल क्षेत्रमिति / Plane Mensuration
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…