Categories: DBMS

SQL: HAVING Clause

The HAVING clause in SQL Server includes one or more conditions that must be TRUE for groups of records. It’s similar to the GROUP BY clause’s WHERE clause. The only distinction is that the WHERE clause cannot be used with aggregate functions, whereas the HAVING clause can.

The HAVING clause is always followed by the GROUP BY clause and preceded by the ORDER BY clause.

Syntax:

SELECT column_name, aggregate_function(column_name)
FROM table_name
GROUP BY column_name
HAVING condition;
Example:

Consider the following Employee table.

EmpIdFirstNameLastNameSalaryDeptId
1JohnKing330001
2JamesBond330001
3NeenaPatel170002
4LexDe Haan150001
5AmitPatel150001
6AbdulKalam250002

Query to display the departments where the sum of salaries is 50,000 or more. In this condition, we will use HAVING Clause.

SELECT DeptId,sum(Salary) as Salary
FROM Employee
GROUP BY DeptId
HAVING SUM(Salary) >= 50000; 

Output:

DeptIdSalary
196000

Note: also read about SQL: Group By Clause

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

1 year ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

1 year ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

1 year ago

Binary Search Tree (BST)

A Binary Search Tree (BST) is a type of binary tree that satisfies the following…

1 year ago