5NF

Duration: 18 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/database-management-systemdbms/decomposition-properties-4nf/fifth-normal-form-5nf/asset-5nf after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
  7. IT Mains: DBMS: 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 Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Fifth Normal Form (5NF) as the final stage in a normalization sequence that includes 1NF, 2NF, 3NF, BCNF, and 4NF. A relation is in 5NF if it is already in 4NF and every non-trivial join dependency (JD) is implied by the candidate keys of the relation. The instructor frames 5NF as removing redundancy caused by complex many-to-many-to-many relationships, using a Supplier-Part-Project example. A sample table SUPPLIER_PART_PROJECT with columns Supplier, Part, and Project contains rows such as S1/P1/J1, S1/P1/J2, S1/P2/J1, and S1/P2/J2. The business rule states that if a supplier supplies a part and works with a project, the corresponding combination is valid. The three-way relationship can be represented using three binary relationships: SP, SJ, and PJ. The lecture walks through decomposing the original relation into these three binary tables and then joining them back to reconstruct SUPPLIER_PART_PROJECT, demonstrating a lossless decomposition. A comparison between 4NF and 5NF is presented: 4NF deals with multivalued dependencies (MVDs), while 5NF deals with join dependencies (JDs) and is also called Project-Join Normal Form. The instructor annotates the comparison table to emphasize that 5NF requires no non-trivial join dependencies except those implied by candidate keys.

Chapters

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

    The lecture opens with a title slide reading 'Decomposition Properties & 4NF' and an underlined subtitle 'Fifth Normal Form (5NF)'. The content page defines 5NF with two bullets: 'It is already in 4NF, and' and 'Every non-trivial join dependency (JD) is implied by the candidate keys of the relation.' The instructor writes '1NF, 2NF' in red under the title, then adds ', 3NF', 'BCNF, 4NF' to complete the normalization sequence. The slide explains that 5NF removes redundancy from complex many-to-many-to-many relationships and asks 'Why do we need 5NF?', using a Supplier-Part-Project example.

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

    A table titled SUPPLIER_PART_PROJECT is shown with columns Supplier, Part, Project and four rows: S1/P1/J1, S1/P1/J2, S1/P2/J1, S1/P2/J2. On-screen text reads 'Suppose the business rule is:' followed by a sentence about a supplier supplying a part and working with a project, ending 'the corresponding combination is valid.' A line at the bottom states 'Here, the three-way relationship can be represented using three binary relationships.' Red handwritten annotations build up: a boxed note with 'CK' crossed out by an arrow to 'non-trivial join dependency', red letters S, P, J beside column headers, braces marking value groups, and an annotation completing to 'CK { (S, P, J) }'.

  3. 5:00 – 10:00 05:00-10:00

    The instructor explains the non-trivial join dependency in the Supplier-Part-Project relation that violates 5NF. The three-way relationship is decomposed into three binary relationships: SP, SJ, and PJ. The instructor writes 'S -> P' in the top right corner, adds 'P -> J' and 'S -> J' with a cross mark next to them, writes the word 'Decomposition', and lists the decomposed relations as SP, SJ, and PJ. A second slide headed 'Fifth Normal Form (5NF)' reiterates the definition bullets, and red notes box 'non-trivial join dependency' with an arrow to '5NF', while a left box is labeled 'Join Dep'. The term '(MVD)' and 'many-to-many-to-many' appear on screen.

  4. 10:00 – 15:00 10:00-15:00

    The opening slide is headed 'Fifth Normal Form (5NF)' with the sequence 1NF, 2NF, 3NF, BCNF, 4NF written in red beneath it. Two definition bullets read 'It is already in 4NF, and (MVFD)' and 'Every non-trivial join dependency (JD) is implied by the candidate keys of the relation.' The example line 'Supplier ↔ Part ↔ Project' is circled in red, with handwritten arrows pointing to the entity pairs SP, PJ and SJ. A 'Step 1: Decompose into three relations' slide displays the tables SUPPLIER_PART, SUPPLIER_PROJECT and PART_PROJECT with rows such as S1-P1, S1-J1 and P2-J2. A 'Step 2: Join the relations' slide shows SUPPLIER_PART + SUPPLIER_PROJECT + PART_PROJECT combining into SUPPLIER_PART_PROJECT, then a tree splitting that table into SP, SJ, and PJ.

  5. 15:00 – 18:13 15:00-18:13

    The video explains 5NF (Project-Join Normal Form) by demonstrating how a non-trivial join dependency can be reconstructed from decomposed tables. A diagram shows the reconstruction of SUPPLIER_PART_PROJECT from SP, SJ, and PJ tables. A comparison table between 4NF and 5NF is presented: the 'Requirement' row contrasts 'non-trivial MVD' with 'candidate key', and the 'Also called' row circles 'Project-Join Normal Form (PJ/NF)'. The instructor annotates the table to emphasize that 5NF removes join-based redundancy and deals with complex relationships, requiring no non-trivial join dependencies except those implied by candidate keys. On-screen text includes 'What does 5NF do?', 'lossless', 'Multivalued Dependency (MVD)', and 'Join Dependency (JD)'.

The lecture builds 5NF as the culmination of a normalization hierarchy. It begins by positioning 5NF after 1NF, 2NF, 3NF, BCNF, and 4NF, then defines it precisely: a relation is in 5NF if it is already in 4NF and every non-trivial join dependency is implied by the candidate keys. The motivation is redundancy in many-to-many-to-many relationships, illustrated with a Supplier-Part-Project table. The core worked example decomposes the three-column relation into three binary relations (SP, SJ, PJ) and then joins them back losslessly to reconstruct the original table. This decomposition-join cycle demonstrates that the join dependency is non-trivial and not implied by candidate keys, hence violating 5NF. The final comparison table distinguishes 4NF (governed by multivalued dependencies) from 5NF (governed by join dependencies, also called Project-Join Normal Form), clarifying that 5NF eliminates the last class of redundancy tied to complex multi-way relationships.

Loading lesson…