SQL Exercise: Salary of FRANK if his salary is equal to max_sal
SQL employee Database: Exercise-58 with Solution
[An editor is available at the bottom of the page to write and execute the scripts.]
58. From the following table, write a SQL query to find the name and salary of the employee FRANK. Salary should be equal to the maximum salary within his or her salary group.
Sample table: employees
Sample table: salary_grade
SELECT e.emp_name, e.salary FROM employees e, salary_grade s WHERE e.emp_name = 'FRANK' AND e.salary BETWEEN s.min_sal AND s.max_sal AND e.salary = s.max_sal ;
emp_name | salary ----------+--------- FRANK | 3100.00 (1 row)
Explanation:The said query in SQL that selects the name and salary of an employee named 'FRANK' whose salary falls within a salary grade range, and whose salary is equal to the maximum salary of that salary grade.
The "WHERE" clause restricts the results to employees whose name is 'FRANK' and whose salary falls within a salary grade range by using the "BETWEEN" operator to compare the employee's salary to the minimum and maximum salaries of the salary grade.
The query then filters the results to employees whose salary is equal to the maximum salary of the salary grade.
Sample Database: employee
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
Previous SQL Exercise: List the employees whose manager name is JONAS.
Next SQL Exercise: Analysts or managers with a salary range, no commission.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
SQL: Tips of the Day
Grouped LIMIT in PostgreSQL: Show the first N rows for each group?
db=# SELECT * FROM xxx; id | section_id | name ----+------------+------ 1 | 1 | A 2 | 1 | B 3 | 1 | C 4 | 1 | D 5 | 2 | E 6 | 2 | F 7 | 3 | G 8 | 2 | H (8 rows)
I need the first 2 rows (ordered by name) for each section_id, i.e. a result similar to:
id | section_id | name ----+------------+------ 1 | 1 | A 2 | 1 | B 5 | 2 | E 6 | 2 | F 7 | 3 | G (5 rows)
PostgreSQL v9.3 you can do a lateral join
select distinct t_outer.section_id, t_top.id, t_top.name from t t_outer join lateral ( select * from t t_inner where t_inner.section_id = t_outer.section_id order by t_inner.name limit 2 ) t_top on true order by t_outer.section_id;
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook