Foreign Key

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/databases-dbms-sql/keys-integrity-constraints/foreign-key-referential-integrity/asset-foreign-key after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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

  1. 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. 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.

Loading lesson…