Introduction of Codd's Rule

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/database-management-systemdbms/normalization-1nf-bcnf/codds-12-rules/asset-introduction-of-codds-rule 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, 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, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. General Aptitude: Ratio and Proportion (Ratios), 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, 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, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  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), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  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 lecture introduces Codd's 12 Rules as the foundation for understanding relational database normalization from 1NF to BCNF. The instructor begins with a title slide, then explains that Codd's Rules, proposed by Dr. E. F. Codd, define the characteristics of a true Relational Database Management System (RDBMS). The session covers why these rules matter—providing standards, ensuring consistent data storage and access, and supporting data independence and integrity—using a diagram of an Application communicating with an RDBMS via SQL requests and data results, with Security and Data Management as supporting functions. The lecture then presents an overview table of Rules 0 through 12, highlighting the Foundation Rule (Rule 0) and Information Rule, before transitioning into Rule 0 with a diagram showing Students, Courses, and Enrollments tables accessed through SQL operations such as CREATE, SELECT, INSERT, and UPDATE.

Chapters

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

    The video opens with a title slide reading "Normalization (1NF - BCNF)" and the underlined subheading "Codd's 12 Rules." Around 65 seconds, the slide changes to "Introduction to Codd's Rules," listing that the rules were proposed by Dr. E. F. Codd and define the characteristics of a true RDBMS. A diagram shows a blue "Relational Database" cylinder connected to Students, Enrollments, and Courses tables with 1:M relationship markers, and callouts for "Row (record)" and "Column (attribute)."

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

    The instructor continues the introduction, underlining key phrases such as "stored, accessed, updated, and managed" to emphasize how the relational model governs data handling. Examples of relational database systems—MySQL, PostgreSQL, and Oracle Database—are given. The slide then transitions to "Why Are Codd's Rules Important?" with bullets stating that the rules provide standards for a true RDBMS, ensure consistent data storage and access, and support data independence and integrity. A diagram places an "Application" box connected by "Request (SQL)" and "Result (Data)" arrows to an "RDBMS" cylinder, flanked by "Security" and "Data Management" boxes.

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

    The importance slide is elaborated with red annotations: checkmarks on the Application box, arrows into the RDBMS, and a circle around "Database." The example line "Changing the physical storage of a student database should not require rewriting the application" illustrates data independence. The presentation then moves to an "Overview of Codd's Rules" table listing Rule No. 0 through 12, including names such as "Foundation Rule," "Information Rule," and "Non-Subversion Rule." A left bracket marks rules 0–6, and a handwritten "(Default)" note appears beside Rule 0.

  4. 10:00 – 11:54 10:00-11:54

    The final segment focuses on Rule 0: Foundation Rule, displaying its definition and an example. A diagram connects Students, Courses, and Enrollments tables to an RDBMS cylinder, with SQL operations labeled CREATE, SELECT, INSERT, and UPDATE shown as the means by which all data access occurs. This sets up the subsequent detailed study of each rule in the normalization sequence.

The lecture establishes Codd's 12 Rules as the theoretical basis for relational database design and normalization. The central progression moves from identifying the rules and their originator, to explaining their practical importance through an application-RDBMS architecture diagram, to cataloging all twelve rules in an overview table, and finally beginning with Rule 0 (Foundation Rule). The recurring diagram of Students, Enrollments, and Courses tables serves as the concrete example throughout. Key takeaways for revision: Codd's Rules define what makes a system a true RDBMS; they ensure data independence so that physical storage changes do not force application rewrites; and all data access must occur through the relational model using SQL operations. The bracketing of rules 0–6 suggests a grouping that may be emphasized in later lectures.

Loading lesson…