Outer Join

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/databases/relational-algebra/join-operations-inner-outer/asset-outer-join after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, 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, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces outer join operations as an extension to standard joins for handling missing information in relational databases. The instructor explains that outer joins preserve tuples that would otherwise be lost by filling unmatched attributes with null values. Three specific forms are defined: left outer join (⋉⊟), right outer join (⊟⋊), and full outer join. The lesson progresses from theoretical definitions to practical construction of result tables using sample relations R1 and R2. The instructor demonstrates how to populate columns A, B, and C by matching tuples based on common attributes. For unmatched rows in the left relation during a left outer join, null values are padded to maintain tuple integrity. Similarly, right and full outer joins ensure all tuples from the respective relations are included in the final result.

Chapters

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

    The video begins by defining outer join operations as an extension to handle missing information, explicitly stating on screen that the operation 'preserves those tuples that would be lost in a join by creating tuples in the result containing null values.' The instructor lists three forms: left outer join (⋉⊟), right outer join (⊟⋊), and full outer join. Moving into the first example, the slide displays 'Left Outer Join' with relations R1 containing tuples (A,B) as (1,P), (2,Q), and (3,R). The instructor starts constructing the result table by writing headers A, B, C and copying values from R1 to demonstrate how unmatched rows are handled.

  2. 2:00 – 3:27 02:00-03:27

    The lecture continues by defining Right Outer Join, noting on screen it 'takes all tuples in the right relation that did not match with any tuple in the left.' The instructor demonstrates constructing the result table for R1 ⋈ R2, showing how to pad tuples with null values. The concept of Full Outer Join is then introduced, defined as doing 'both the left and right outer join operations.' The instructor manually writes out the resulting table for R1 ⋈ R2, visually showing how unmatched tuples from both relations are included with null padding to form the complete joined relation.

The core pedagogical progression moves from abstract definition to concrete application. The instructor establishes that outer joins solve the problem of data loss in standard joins by introducing null padding. This is operationalized through three distinct variations: left, right, and full outer joins. The visual evidence shows a consistent method of table construction where the instructor first lists input relations R1 and R2, then builds a result schema. For left outer joins, the focus is on preserving all rows from R1 even if they lack matches in R2. For right outer joins, the preservation extends to R2. The full outer join combines both strategies. The notation ⋉⊟, ⊟⋊, and the combined symbol are explicitly used to distinguish these operations in relational algebra. The repeated use of relations R1 and R2 with specific values (1,P), (2,Q), (3,R) provides a consistent dataset for comparing the outcomes of different join types.

Loading lesson…