Dependency Preserving Decomposition

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/database-management-system/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. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, 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, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
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…