SQL query

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/database-management-systemdbms/sql/group-by-clause/asset-sql-query after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. 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
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on constructing a complex SQL query based on a provided database schema. The specific task is to retrieve branch names located in Gwalior where the average account balance exceeds 1500. The instructor begins by dissecting the question to identify necessary tables (branch and account) and attributes (branch-name, branch-city, balance). He then proceeds to write the SQL code on a digital whiteboard, initially using implicit join syntax (comma-separated tables in the FROM clause) and later refining it to use explicit JOIN syntax. Key concepts covered include filtering rows with the WHERE clause, grouping data with GROUP BY, and filtering aggregated results with the HAVING clause. The instructor emphasizes the logical order of SQL execution and the distinction between filtering individual records versus filtering groups. The schema also shows depositor, customer, loan, and borrower tables, but the instructor correctly identifies that only branch and account are needed for this specific query.

Chapters

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

    The instructor reads the problem statement: 'Write a SQL query to find the branch name of Gwalior city with average balance more than 1500?' He analyzes the Entity-Relationship diagram, specifically pointing to the branch table to identify branch-name and branch-city as the source for location data. He then identifies the account table as the source for the balance attribute. He notes the relationship between these tables is established through the branch-name attribute, which acts as a foreign key in the account table referencing the branch table. He visually traces the line connecting branch and account to confirm the join path.

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

    The instructor starts writing the SQL query structure. He writes SELECT b.branch-name to specify the output column. In the FROM clause, he lists branch b, account a to introduce both tables with aliases. He adds a WHERE clause to join them: b.branch-name = a.branch-name. He then introduces GROUP BY b.branch-name because the query requires an aggregate calculation (AVG). He writes HAVING AVG(a.balance) > 1500 to filter the groups. He realizes he missed the city condition and adds AND b.branch-city = 'Gwalior' to the WHERE clause, explaining that this filters the rows before grouping occurs. He underlines the branch-name in the account table to emphasize the join key.

  3. 5:00 – 8:22 05:00-08:22

    The instructor rewrites the query using explicit JOIN syntax for better readability. He writes FROM branch b JOIN account a ON b.branch-name = a.branch-name. He moves the city condition WHERE b.branch-city = 'Gwalior' to the WHERE clause. He retains GROUP BY b.branch-name and HAVING AVG(a.balance) > 1500. He explains that the WHERE clause filters individual rows (e.g., removing accounts not in Gwalior) before the grouping happens. The GROUP BY clause then organizes the remaining accounts by branch. Finally, the HAVING clause filters these groups, keeping only branches where the calculated average balance is greater than 1500. The text 'KNOWLEDGE GATE' is visible in the background watermark.

The lesson effectively demonstrates the step-by-step construction of a SQL query involving multiple tables and aggregate functions. It highlights the importance of understanding the database schema to identify correct join paths. The progression from implicit joins to explicit joins shows a move towards best practices in SQL writing. The distinction between WHERE and HAVING is a critical takeaway, as WHERE filters raw data while HAVING filters aggregated data, a common point of confusion for students. The final query structure SELECT ... FROM ... JOIN ... WHERE ... GROUP BY ... HAVING ... represents a standard pattern for reporting queries. The instructor's methodical approach ensures students understand not just the syntax, but the logical flow of data processing in SQL.

Loading lesson…