Lossy-Lossless Decomposition Using FD

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/database-systems/decomposition-properties-4nf/lossless-join-decomposition/asset-lossy-lossless-decomposition-using-fd after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow 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
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture covers the critical concept of lossless and lossy decomposition in database normalization. The instructor explains that when a relation is decomposed into smaller relations, it is crucial to ensure that the original data can be reconstructed without loss or spurious data. He defines lossless join decomposition as a process where the natural join of the decomposed relations equals the original relation. He contrasts this with lossy decomposition, where the join produces extra (spurious) tuples or loses original tuples. The lecture emphasizes that lossless decomposition is a mandatory property for any valid normalization strategy. The instructor uses a concrete example to show how a lossy decomposition generates incorrect data, and then formalizes the definitions using set notation to provide a rigorous understanding of the concept.

Chapters

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

    The instructor begins by stating that normalization involves decomposing a table into two or more tables. He emphasizes that during this process, we must ensure the satisfaction of certain properties. The slide text explicitly states, 'Because of a normalization a table is Decomposed into two or more tables, but during this decomposition we must ensure satisfaction of some properties out of which the most important is lossless join property / decomposition.' This sets the context for the entire lecture, highlighting the importance of data integrity and the necessity of preserving information when splitting relations. He introduces the topic by explaining that while decomposition is a standard part of normalization, it comes with constraints that must be met to avoid data corruption.

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

    The instructor illustrates the concept with a specific example. He presents a relation r with columns A, B, and C, containing tuples (1, a, p), (2, b, q), and (3, a, r). He shows how this table is decomposed into r1 (A, B) and r2 (B, C). He then demonstrates the natural join of r1 and r2. The resulting table has columns A, B, C but contains extra tuples like (1, a, q) and (3, a, p) which were not present in the original relation. He circles these spurious tuples to visually demonstrate that the join operation has generated incorrect data, characterizing this as a lossy decomposition where the original information is not perfectly recoverable. He specifically points out that the join produces tuples that did not exist before, leading to data inconsistency. He highlights that the original table had 3 tuples, but the join resulted in 5 tuples, proving that information was added incorrectly. This visual demonstration helps students understand the practical implications of a lossy decomposition.

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

    The instructor formalizes the concepts using mathematical notation. He writes on the slide: 'Decomposition is lossy if R1 ⋈ R2 ⊃ R' and 'Decomposition is lossy if R ⊃ R1 ⋈ R2'. He then defines the condition for a lossless decomposition: 'Decomposition is lossless if R1 ⋈ R2 = R'. He explains that this equality ensures the join of the decomposed relations yields the exact same relation as the original, guaranteeing that no spurious tuples are generated. He stresses that this property is 'extremely critical and must be achieved at any cost' and introduces the term 'NonAdditive Join Decomposition' as a synonym for lossless decomposition. He underlines the terms 'lossless Decomposition' and 'NonAdditive Join Decomposition' to reinforce their equivalence. He emphasizes that achieving this property is the primary goal of normalization. The slide also shows a diagram illustrating the relationship between R, R1, and R2.

The lecture progresses from a general introduction to decomposition properties to a specific example of lossy decomposition, and finally to the formal definition of lossless decomposition. The key takeaway is that lossless join is a non-negotiable requirement for database normalization to ensure data integrity. The instructor uses visual aids and mathematical notation to clarify the distinction between lossy and lossless scenarios, emphasizing that the latter is essential for maintaining the correctness of the database schema. The video concludes by reinforcing that this property must be achieved at any cost.

Loading lesson…