Dependency Preserving Decomposition

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/data-base-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. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…