Group By Contd...

Duration: 19 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-group-by-contd 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.

This lecture segment focuses on the rules and mechanics of SQL GROUP BY, HAVING, and aggregation. The instructor establishes that any attribute in the SELECT clause must either be aggregated or included in the GROUP BY clause to prevent errors. The HAVING clause is introduced as a mechanism for filtering groups after aggregation, distinct from the WHERE clause which filters individual tuples. The lesson concludes by defining the formal sequence of operations for SQL query evaluation involving these clauses.

Chapters

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

    The instructor introduces the fundamental rules governing SQL GROUP BY and HAVING clauses. He emphasizes that non-aggregated attributes in a SELECT statement must be present in the GROUP BY clause to avoid errors. The text on screen states, 'When an SQL query uses grouping, it is important to ensure that the only attributes that appear in the select…' and 'In other words, any attribute that is not present in the group by clause must appear only inside an aggregate function…'. The instructor underlines key terms and uses hand gestures to stress the distinction between individual tuples and groups, setting the stage for understanding aggregation constraints.

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

    The lecture transitions to the HAVING clause, explaining its purpose in filtering groups rather than individual tuples. The slide text reads, 'The Having Clause - At times it is useful to state a condition that applies to groups rather than to tuples.' The instructor clarifies that SQL applies predicates in the HAVING clause after groups have been formed. He notes, 'Any attribute that is present in the having clause without being aggregated must appear in the group by clause,' reinforcing the consistency required between GROUP BY and HAVING attributes. Visual cues include red underlining of key terms to highlight syntax requirements.

  3. 5:00 – 10:00 05:00-10:00

    The instructor provides concrete SQL examples to illustrate valid and invalid queries. He writes 'select (dno) from emp group by dno' as a valid example and contrasts it with 'select eno, from emp group by dno;' which is invalid due to the missing GROUP BY attribute. The lesson emphasizes that attributes in SELECT must be either aggregated or grouped. He introduces the concept of filtering groups using HAVING, noting that 'SQL applies predicates in the having clause after groups have been formed.' The instructor uses checkmarks and crosses to visually indicate correct versus incorrect syntax, ensuring students understand the strict rules for non-aggregated attributes.

  4. 10:00 – 15:00 10:00-15:00

    The focus shifts to the sequence of operations in SQL query evaluation. The instructor explains that the meaning of a query containing aggregation, GROUP BY, or HAVING is defined by a specific order. He writes out the steps on the slide: '1. As was the case for queries without aggregation, the from clause is first evaluated to get a relation.' He continues with '2. If a where clause is present, the predicate in the where clause is applied on the result relation of the from clause.' This section clarifies that WHERE filters before GROUP BY, establishing the logical flow of query processing.

  5. 15:00 – 18:37 15:00-18:37

    The instructor completes the sequence of operations by detailing steps 3 through 5. He explains, '3. Tuples satisfying the where predicate are then placed into groups by the group by clause if it is present.' He further states, '4. The having clause, if it is present, is applied to each group; the groups that do not satisfy the having clause…' Finally, he concludes with '5. The select clause uses the remaining groups to generate tuples of the result of the query.' Using a sample query 'select empno dno, count(eno) from emp', he numbers each clause (1-5) to map them to their execution order, demonstrating how FROM starts the process and SELECT finishes it.

The lecture systematically builds understanding of SQL aggregation rules. It begins by defining the constraint that non-aggregated SELECT attributes must appear in GROUP BY, preventing common syntax errors. The HAVING clause is then distinguished from WHERE by its application to groups post-aggregation, requiring similar attribute constraints. The final section formalizes the query evaluation sequence: FROM -> WHERE -> GROUP BY -> HAVING -> SELECT. This logical order is critical for understanding how SQL processes complex queries, ensuring students grasp that filtering happens before grouping and aggregation results are filtered again by HAVING before the final projection.

Loading lesson…