SQL Exercise: Customers and their cities for given range of orders

Last update on February 07 2023 09:47:12 (UTC/GMT +8 hours)

SQL JOINS: Exercise-2 with Solution

From the following tables write a SQL query to find those orders where the order amount exists between 500 and 2000. Return ord_no, purch_amt, cust_name, city.

Sample table: orders

Sample table: customer

Sample Solution:

SELECT  a.ord_no,a.purch_amt,
b.cust_name,b.city 
FROM orders a,customer b 
WHERE a.customer_id=b.customer_id 
AND a.purch_amt BETWEEN 500 AND 2000;

Output of the Query:

ord_no	purch_amt	cust_name	city
70007	948.50		Graham Zusi	California
70010	1983.43		Fabian Johnson	Paris

Explanation:

The said SQL query is selecting the order number, purchase amount, customer name and customer city from the "orders" table as alias a and "customer" table as alias b, and only displaying results where the customer ID of the "orders" table matches the customer ID of the "customer" table and the purchase amount is between 500 and 2000.

Relational Algebra Expression:

Relational Algebra Tree:

Explanation:

Syntax to make a list with order no, purchase amount, customer name and their cities for those orders which order amount between 500 and 2000

Visual Explanation:

Result to make a list with order no, purchase amount, customer name and their cities for those orders which order amount between 500 and 2000

Practice Online

Query Visualization:

Duration:

Rows:

Cost:

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

Previous SQL Exercise: Salesmen and customer, who belongs to same city.
Next SQL Exercise: A list of which salesmen work for which customers.

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;

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