Computer Science · Database Management Systems
Why can filtering data using the HAVING clause be slower and less efficient than using the WHERE clause in a SQL query?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1The HAVING clause entirely ignores NULL values, causing full table scans
- 2The HAVING clause executes first before the tables are even scanned
- 3The HAVING clause operates on aggregated data after the grouping phase, rather than filtering raw rows early✓
- 4The HAVING clause always utilizes indexes, which adds overhead
Correct answer
The HAVING clause operates on aggregated data after the grouping phase, rather than filtering raw rows early
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems