Set Operations In SQL
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 video is a lecture on SQL set operations, specifically focusing on UNION, INTERSECT, and EXCEPT (or MINUS). The instructor, Sanchit Jain, uses a bank database schema to demonstrate how to write queries for specific customer conditions. He begins by presenting three distinct questions regarding customers with loans and accounts. He then transitions to a theoretical slide explaining the mathematical set theory behind these SQL operations, emphasizing how duplicates are handled by default versus using the ALL keyword. Finally, he applies these concepts back to the initial problems, demonstrating how to construct queries using UNION for "or" conditions and EXCEPT for "but not" conditions. The lecture emphasizes the difference between standard set operations and their ALL counterparts.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces a problem set asking for SQL queries to find customer names based on their loan and account status. He references an ER diagram on the left, circling the account, depositor, customer, loan, and borrower tables to identify relevant data sources. He begins constructing the solution for part (a) "who have a loan or an account or both?" by writing two separate SELECT statements: Select custname from depositor and Select custname from borrower. He connects these with the UNION operator, explaining that this combines the results. He also mentions the UNION ALL variant as a way to keep duplicates if necessary. He writes Select custname from depositor and Select custname from borrower on the whiteboard space.
2:00 – 4:27 02:00-04:27
The lecture shifts to a slide titled "Set Operation" to define the theoretical basis. The slide lists four points: SQL operations correspond to set theory (U, n, -); UNION eliminates duplicates by default; INTERSECT eliminates duplicates by default; and EXCEPT eliminates duplicates by default. The instructor circles key terms like union, intersect, except, and the ALL modifiers. He specifically highlights the text "The union operation automatically eliminates duplicates, unlike the select clause." He returns to the handwritten queries to solve part (c) "who have a loan but do not have an account?". He draws a Venn diagram for set difference (A - B) and writes the query using EXCEPT: Select custname from borrower followed by Select custname from depositor with EXCEPT in between. He explains that A - B represents the set difference, visually reinforcing the concept.
The lesson effectively bridges theoretical set theory with practical SQL syntax. By starting with concrete database questions, the instructor grounds the abstract concepts of UNION, INTERSECT, and EXCEPT. The transition to the definition slide clarifies the behavior of these operators regarding duplicate elimination, a crucial detail for exam questions. The return to the handwritten examples solidifies the application, showing how UNION answers "or" questions and EXCEPT answers "but not" questions, providing a complete workflow for solving set-based SQL problems. The visual aids, including the ER diagram and Venn diagrams, support the logical flow of the explanation. The instructor's use of the whiteboard to write out the queries step-by-step helps students follow the syntax construction.

