Closure Set of Attributes

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/database-management-systemdbms/relational-model-functional-dependencies/attribute-closure-equivalence-of-sets/asset-closure-set-of-attributes after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on the concept of Attribute Closure within the context of database normalization and functional dependencies. The instructor, identified as Sanchit Jain Sir from Knowledgegate Educator, begins by defining attribute closure as the set of all attributes functionally determined by a given attribute set, either directly from functional dependencies (FDs) or through logical derivation. The notation used is discussed, followed by a practical demonstration of the Direct Method to calculate closures. Several examples are worked through step-by-step to illustrate how to apply functional dependencies iteratively to expand the attribute set until no new attributes can be added. The lecture emphasizes the systematic approach required to solve these problems for exams.

Chapters

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

    The session opens with a slide titled ATTRIBUTES CLOSURE/CLOSURE ON ATTRIBUTE SET/ CLOSURE SET OF ATTRIBUTES. The instructor defines attribute closure as the set of attributes which can be functionally determined from F and notes it is DENOTED BY F+. He underlines key terms like Attribute closure, attribute set, and functionally determined to emphasize their importance. He also highlights the text Set of all attributes Functionally determined by X either directly from FD'S or logically derived. He then introduces the first example: In a Relation R (A, B, C, D), with set of functional dependencies as- { A -> B, B -> C, AB -> D }. He begins calculating A+ by writing A = A in red ink. He then applies the dependency A -> B to add B, resulting in AB. Next, he uses B -> C to add C, resulting in ABC. Finally, he applies AB -> D to add D, concluding the closure is ABCD.

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

    The instructor moves to a second example involving a larger relation. The slide shows Q R(ABCDEFG) with dependencies A -> B, BC -> DE, and AEG -> G. The task is to find (AC)+. He starts with AC written in red. Using A -> B, he adds B to get ABC. Then, utilizing the dependency BC -> DE, he adds D and E to the set, resulting in ABCDE. He circles the final result ABCDE to highlight the answer. He then presents a third example: Q R(ABCDE) with dependencies A -> BC, CD -> E, B -> D, and E -> A. The goal is to find (B)+. He starts with B. Applying B -> D, he adds D to get BD. Since no other dependencies can be triggered by B or D, he circles BD as the final closure.

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

    The final segment covers a fourth example: Q R(ABCDEF) with dependencies AB -> C, BC -> AD, D -> E, and CF -> B. The objective is to calculate (AB)+. The instructor writes AB initially. He applies AB -> C to get ABC. He crosses out AB -> C. Next, he uses BC -> AD to add A and D (A is already there), resulting in ABCD. He crosses out BC -> AD. Then, he applies D -> E to add E, resulting in ABCDE. He circles ABCDE as the final answer, demonstrating the iterative process of finding attribute closure until no new attributes can be derived. The video concludes with this completed example.

The video effectively bridges theoretical definitions with practical application. By starting with a clear definition of attribute closure and its notation, the instructor sets a strong foundation. The progression through multiple examples of increasing complexity demonstrates the Direct Method clearly. Each example reinforces the iterative nature of the process, showing how to systematically apply functional dependencies to expand an attribute set. The visual cues, such as underlining key terms and circling final answers, help students track the solution process. This structured approach ensures that learners can replicate the method for solving similar problems in database normalization.

Loading lesson…