SQL Exercise: Display the location of CLARE

SQL employee Database: Exercise-71 with Solution

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

71. From the following table, write a SQL query to find the department location of employee ‘CLARE’. Return department location.

Pictorial Presentation:

SQL exercises on employee Database: Display the location of CLARE

Sample table: employees

Sample table: department

Sample Solution:

SELECT dep_location
FROM department d,
     employees e
WHERE e.emp_name = 'CLARE'
  AND e.dep_id = d.dep_id ;

Sample Output:

(1 row)


The provided query in SQL that retrieves the department location of the employee named 'CLARE' by joining the 'department' and 'employees' tables based on the "dep_id" column.

The query returns a single column "dep_location" from the 'department' table where the "dep_id" column matches the "dep_id" column in the 'employees' table for the employee named 'CLARE'.

Relational Algebra Expression:

Relational Algebra Expression: Display the location of CLARE.

Relational Algebra Tree:

Relational Algebra Tree: Display the location of CLARE.

Practice Online

Sample Database: employee

employee database structure

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

Previous SQL Exercise: Employees who are CLERK, ANALYST in descending order.
Next SQL Exercise: Employees joining on given days, ascending in seniority.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

Follow us on Facebook and Twitter for latest update.

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;

Database: PostgreSQL

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


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