w3resource

SQL exercises on employee Database: Display all the details of the employees whose commission is more than their salary

SQL employee Database: Exercise-15 with Solution

[An editor is available at the bottom of the page to write and execute the scripts.]

15. From the following table, write a SQL query to find those employees whose commission is more than their salary. Return complete information about the employees.

Sample table: employees


Pictorial Presentation:

SQL exercises on employee Database: Display all the details of the employees whose commission is more than their salary.

Sample Solution:

SELECT *
FROM employees
WHERE commission>salary;

Sample Output:

 emp_id | emp_name | job_name | manager_id | hire_date  | salary  | commission | dep_id
--------+----------+----------+------------+------------+---------+------------+--------
  66564 | MADDEN   | SALESMAN |      66928 | 1991-09-28 | 1350.00 |    1500.00 |   3001
(1 row)

Relational Algebra Expression:

Relational Algebra Expression: Display all the details of the employees whose commission is more than their salary.

Relational Algebra Tree:

Relational Algebra Tree: Display all the details of the employees whose commission is more than their salary.

Practice Online


Sample Database: employee

employee database structure

Have another way to solve this solution? Contribute your code (and comments) through Disqus.

Previous: From the following table, write a SQL query to find the details of the employee ‘BLAZE’.
Next: From the following table, write a SQL query to find those employees whose salary exceeds 3000 after giving 25% increment. Return complete information about the employees.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



SQL: Tips of the Day

MYSQL OR vs IN performance:

In many database servers, IN() is just a synonym for multiple OR clauses, because the two are logically equivalent. Not so in MySQL, which sorts the values in the IN() list and uses a fast binary search to see whether a value is in the list. This is O(Log n) in the size of the list, whereas an equivalent series of OR clauses is O(n) in the size of the list (i.e., much slower for large lists)

Ref: https://bit.ly/3PzLY69