All About Multivaluated Dependency

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/database-management-systemdbms/decomposition-properties-4nf/multivalued-dependency-mvd-4nf/asset-all-about-multivaluated-dependency after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: 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
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Multivalued Dependencies (MVDs) as a consequence of First Normal Form (1NF) restrictions, which disallow attributes from having sets of values. The instructor defines the notation $A woheadrightarrow B$ and distinguishes it from functional dependencies using a table example. The concept of trivial MVDs is explained, where the right-hand side is a subset of the left-hand side or they form the entire relation. Finally, a detailed example of a Student relation demonstrates how MVDs cause redundancy even when a schema is in BCNF, illustrating the cross-product effect of independent multivalued attributes.

Chapters

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

    The video begins with the title 'Multivalued Dependency' on the slide. The first bullet point states that MVDs are a 'consequence of first normal form (1NF) which disallows an attribute in a tuple to have a set of values'. The instructor introduces the notation $A woheadrightarrow B$, explaining it means 'for every value of A, there may exist more than one value of B'. He writes $A ightarrow B$ on the screen, then corrects it to $A woheadrightarrow B$. He draws a table with columns A and B, populating it with values: 1 maps to a, 2 maps to a, and 1 maps to b. This visual demonstrates that for A=1, there are multiple values of B (a and b), which is characteristic of a multivalued dependency rather than a functional dependency.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to 'trivial multivalued dependency'. The slide text defines this as a dependency $X woheadrightarrow Y$ where 'either Y is a subset of X, or X and Y together form the whole set of attributes of the relation'. The instructor writes 'T' for Trivial and 'NT' for Non-Trivial. He provides an example $AB woheadrightarrow B$, labeling AB as LHS and B as RHS. He writes the condition $RHS \subseteq LHS$ to show that if the right-hand side is a subset of the left-hand side, the dependency is trivial. He draws a table with columns X and Y to visualize this relationship, reinforcing that if Y is contained within X, the dependency holds trivially.

  3. 5:00 – 7:33 05:00-07:33

    The instructor presents a concrete example using a relation named 'Student'. The slide lists two constraints: $S\_name woheadrightarrow Club\_name$ and $S\_name woheadrightarrow P\_no$. He shows two decomposed tables: one linking Kamesh to Dance and Guitar, and another linking Kamesh to phone numbers 123 and 789. He then displays a combined table with columns S_Name, Club_name, and P_no. He explains that because the club names and phone numbers are independent multivalued attributes, the combined table must contain the cross-product of these values. This results in four rows: (Kamesh, Dance, 123), (Kamesh, Guitar, 123), (Kamesh, Dance, 789), and (Kamesh, Guitar, 789). He circles the P_no values 123 and 789 to highlight the repetition. A note at the bottom states the schema is in BCNF but still has redundancy due to MVD.

The lesson progresses from the theoretical definition of Multivalued Dependencies as a consequence of 1NF to the specific notation $A woheadrightarrow B$. It clarifies the distinction between functional and multivalued dependencies through visual table examples. The concept of trivial MVDs is then defined based on subset relationships between attributes. Finally, the practical implication of MVDs is demonstrated using a Student relation, showing how independent multivalued attributes create a cross-product effect that leads to data redundancy, even in a BCNF schema.

Loading lesson…