Dependency Preserving Decomposition

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-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 the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर नेटवर्क / Computer Networks
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
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…