Rule-5 to Rule-12

Duration: 22 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-rule-5-to-rule-12 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 covers Codd's Rules 5 through 12 for relational database management systems, using SQL examples and annotated slides. Rule 5, the Comprehensive Data Sublanguage rule, requires a DBMS to support at least one relational language for data definition, manipulation, views, constraints, and authorization. The instructor illustrates this with SQL commands: CREATE for defining tables, SELECT for retrieving data, INSERT for adding data, GRANT for managing permissions, and COMMIT for completing transactions. Rule 6, the View Updating Rule, states that every theoretically updatable view must be updatable by the DBMS. The example creates StudentView using SELECT RollNo, Name FROM Student, showing how updates to the view propagate to the base Student table. Rule 7 demonstrates set-level updating with UPDATE Student SET Branch = 'IT' WHERE Branch = 'CSE', comparing before and after tables. Rule 8, Physical Data Independence, explains that changes to physical storage, such as replacing an HDD with an SSD, should not require changes to applications. Rule 9, Logical Data Independence, shows that adding an Email column to an Employee table does not affect applications that use only EmpID and Name. Rule 10, Integrity Independence, uses CREATE TABLE Student with RollNo INT PRIMARY KEY to show that integrity constraints such as primary key uniqueness and NOT NULL are independent of other rules. Rule 11, Distribution Independence, shows an application retrieving customer data from a database system spanning Delhi, Mumbai, and Bangalore servers without knowing which server stores each record. Rule 12, the Non-Subversion Rule, states that a DBMS with a relational language must not allow users to bypass integrity constraints through a low-level interface. The example shows INSERT INTO Student VALUES (1, 'Rohan') and a constraint violation box, with the Student table listing RollNo 1 Rohan, 2 Neha, 3 Amit, and constraints Primary Key (RollNo) and NOT NULL.

Chapters

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

    The lecture introduces Rule 5: Comprehensive Data Sublanguage, stating that a DBMS must support at least one relational language. The slide lists SQL commands with their functions: CREATE = Define tables, SELECT = Retrieve data, INSERT = Add data, GRANT = Manage permissions, and COMMIT = Complete a transaction. The instructor circles the rule title in red and underlines the definition line, then draws red checkmarks beside each SQL command to emphasize that SQL satisfies the rule's requirements for data definition, manipulation, views, constraints, and authorization.

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

    The instructor continues explaining Rule 5, using a diagram that maps SQL commands to their database functions. The slide shows the definition that the DBMS must support at least one relational language handling data definition, manipulation, views, and constraints. Red arrows and boxes highlight specific parts of the SQL examples, and the instructor points to the COMMIT command to complete the transaction example. The transition then moves to Rule 6: View Updating Rule, whose definition states that every theoretically updatable view must be updatable by the DBMS.

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

    Rule 6 is illustrated with the SQL statement CREATE VIEW StudentView AS SELECT RollNo, Name FROM Student. A diagram shows the Student base table and the StudentView, with the view selecting specific columns. The instructor draws red lines connecting the base table and the view to show data flow, and crosses out specific values in both tables to illustrate an update operation. This demonstrates that when a view satisfies the conditions for updatability, updates made through the view are reflected in the base table.

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

    The lecture covers Rules 7, 8, and 9. Rule 7 shows set-level updating with the SQL block UPDATE Student SET Branch = 'IT' WHERE Branch = 'CSE', placed between Before Update and After Update tables. Red circles mark the CSE cells in the Before table and red ticks mark the IT cells in the After table. Rule 8, Physical Data Independence, circles the phrases physical storage and changes to applications, and links an HDD icon to an SSD icon via a Replace Storage Device arrow, showing that storage changes do not affect applications. Rule 9, Logical Data Independence, shows an Employee table gaining an Email column while the application box still reads Uses only EmpID and Name.

  5. 15:00 – 20:00 15:00-20:00

    Rule 9 is further detailed with two application panels using only EmpID and Name above an Employee table that gains a pink Email column with values rohan@gmail.com, neha@gmail.com, and amit@gmail.com. A green arrow labeled Add new column to the table points from the Before table to the After table, and a green note reads Application continues to work without any changes because it only uses EmpID and Name. The lecture then moves to Rule 10: Integrity Independence, displaying the code block CREATE TABLE Student ( RollNo INT PRIMARY KEY, Name VARCHAR(50) ); with PRIMARY KEY highlighted in yellow. The slide notes that a primary key ensures each RollNo is unique and cannot be NULL, and that duplicate values are not allowed for a primary key.

  6. 20:00 – 21:41 20:00-21:41

    The final segment covers Rules 11 and 12. Rule 11: Distribution Independence shows a diagram linking an Application to a Database System and three Database Servers labeled Delhi, Mumbai, and Bangalore. A green callout box states Application retrieves customer data without needing to know which server stores each record. Rule 12: Non-Subversion Rule shows a Low-Level Interface, the code block INSERT INTO Student VALUES (1, 'Rohan'), and a Constraint Violation box. The Student Table lists RollNo 1 Rohan, 2 Neha, 3 Amit, alongside constraints Primary Key (RollNo) and NOT NULL, illustrating that users cannot bypass integrity constraints through a low-level interface.

The lecture progresses systematically through Codd's Rules 5 to 12, each introduced with a definition slide followed by a concrete SQL or diagrammatic example. Rule 5 establishes the need for a comprehensive data sublanguage, using SQL commands as the canonical example. Rule 6 introduces view updatability with a StudentView example, emphasizing the relationship between views and base tables. Rules 7 through 9 address data independence at different levels: set-level updating, physical storage changes, and logical schema changes. Rule 10 focuses on integrity constraints, particularly primary keys. Rules 11 and 12 address distribution transparency and the prohibition of bypassing integrity through low-level interfaces. The teaching method consistently pairs abstract rule definitions with visual diagrams, SQL code blocks, and red annotations to highlight key terms and data flow. The examples use recurring entities such as Student, Employee, and customer data to maintain continuity across rules.

Loading lesson…