Group By Contd...
Duration: 19 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, 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, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
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
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: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.
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.
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.
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.

