Foreign Key
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 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 Database Recovery
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces the concept of Foreign Keys in relational database management systems. The instructor begins with a formal definition, explaining that a foreign key is a column or group of columns that refers to the primary key of the same or another table to establish a relationship. He highlights that the concept of referential integrity stems from foreign key theory. The lesson progresses to practical examples, starting with a student database table containing redundant information about branches. The instructor demonstrates normalization by splitting this into two tables: a student table and a branch table. He identifies `Br_code` as the primary key in the branch table and a foreign key in the student table, drawing a relationship arrow between them. He emphasizes that the foreign key values must exist in the referenced primary key column. Finally, he introduces a second example involving student IDs and marks IDs to further illustrate how foreign keys link tables and enforce data integrity constraints.
Chapters
0:00 – 2:00 00:00-02:00
The instructor defines a foreign key using on-screen text: "A foreign key is a column or group of columns in a relational database table that refers the primary key of the same table or some other table to represent relationship." He introduces the concept of referential integrity. He then presents a large table with columns `Roll no`, `name`, `Age`, `Br_code`, `Br_name`, and `Br_hod_name`. He explains that this table has redundancy. He decomposes it into two tables: a student table (`stu`) with `Roll no`, `name`, `Age`, `Br_code` and a branch table (`Br`) with `Br_code`, `Br_name`, `Br_hod_name`. He marks `Br_code` in the student table as a Foreign Key (FK) and `Br_code` in the branch table as a Primary Key (PK). He draws a red curved arrow from the FK to the PK to show the relationship. He circles the `Br_code` values (101, 101, 101, 102) in the student table to show they reference the branch table. He writes 'stu' and 'Br' next to the tables.
2:00 – 4:18 02:00-04:18
The instructor continues the explanation of the relationship between the tables. He writes "FK <= PK" above the red arrow, signifying that the set of foreign key values must be a subset of the primary key values. He circles the `Br_code` column in the top table and writes "FK <= PK" again to reinforce the constraint. He then transitions to a new example on a blank slide. He draws a table with columns `S_id` and `M_id`. He populates the table with values: `S_id` has 1, 2, 3, 4, 5, 6 and `M_id` has 1, 1, 1, 4, 4, 4. He explains that `M_id` acts as a foreign key referencing a marks table. He draws an arrow from `M_id` to the right to indicate the reference to another table. He emphasizes that the values in the foreign key column (`M_id`) must correspond to valid primary keys in the referenced table, ensuring referential integrity.
The video effectively bridges theoretical definitions with practical database design. By starting with a formal definition and immediately applying it to a normalization example, the instructor clarifies how foreign keys eliminate redundancy. The visual aids, such as the decomposition of the student-branch table and the "FK <= PK" notation, provide clear visual cues for understanding referential integrity constraints. The transition to a second example with `S_id` and `M_id` reinforces the concept that foreign keys are not limited to a single scenario but are a fundamental mechanism for linking related data across different tables in a relational database.

