explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Pwcj

Settings
# exclusive inclusive rows x rows loops node
1. 0.013 19.529 ↓ 0.0 0 1

Hash Join (cost=1,172.49..2,089.39 rows=206 width=472) (actual time=19.529..19.529 rows=0 loops=1)

  • Hash Cond: (line.ref_orderline_id = refline.fil_orderline_id)
2. 0.000 0.000 ↓ 0.0 0

Append (cost=724.09..1,635.25 rows=412 width=97) (never executed)

3. 0.000 0.000 ↓ 0.0 0

Hash Join (cost=724.09..1,624.01 rows=410 width=97) (never executed)

  • Hash Cond: (line.m_requisition_id = req.m_requisition_id)
4. 0.000 0.000 ↓ 0.0 0

Hash Right Join (cost=699.36..1,380.44 rows=410 width=88) (never executed)

  • Hash Cond: (poline.c_orderline_id = line.c_orderline_id)
5. 0.000 0.000 ↓ 0.0 0

Seq Scan on c_orderline poline (cost=0.00..631.69 rows=9,169 width=12) (never executed)

6. 0.000 0.000 ↓ 0.0 0

Hash (cost=694.23..694.23 rows=410 width=83) (never executed)

7. 0.000 0.000 ↓ 0.0 0

Hash Join (cost=24.06..694.23 rows=410 width=83) (never executed)

  • Hash Cond: (coline.c_orderline_id = line.ref_orderline_id)
8. 0.000 0.000 ↓ 0.0 0

Seq Scan on c_orderline coline (cost=0.00..631.69 rows=9,169 width=12) (never executed)

9. 0.000 0.000 ↓ 0.0 0

Hash (cost=18.47..18.47 rows=447 width=77) (never executed)

10. 0.000 0.000 ↓ 0.0 0

Seq Scan on m_requisitionline line (cost=0.00..18.47 rows=447 width=77) (never executed)

11. 0.000 0.000 ↓ 0.0 0

Hash (cost=18.77..18.77 rows=477 width=15) (never executed)

12. 0.000 0.000 ↓ 0.0 0

Seq Scan on m_requisition req (cost=0.00..18.77 rows=477 width=15) (never executed)

13. 0.000 0.000 ↓ 0.0 0

Subquery Scan on *SELECT* 2 (cost=0.00..6.60 rows=1 width=0) (never executed)

14. 0.000 0.000 ↓ 0.0 0

Result (cost=0.00..6.59 rows=1 width=0) (never executed)

  • One-Time Filter: false
15.          

SubPlan (for Result)

16. 0.000 0.000 ↓ 0.0 0

Limit (cost=1.05..1.06 rows=1 width=8) (never executed)

17. 0.000 0.000 ↓ 0.0 0

Sort (cost=1.05..1.06 rows=1 width=8) (never executed)

  • Sort Key: brk.breakvalue DESC
18. 0.000 0.000 ↓ 0.0 0

Seq Scan on fil_processingtime_break brk (cost=0.00..1.04 rows=1 width=8) (never executed)

  • Filter: ((movementqty >= breakvalue) AND (fil_processingtime_id = fil_processingtime_id))
19. 0.000 0.000 ↓ 0.0 0

Limit (cost=1.05..1.06 rows=1 width=8) (never executed)

20. 0.000 0.000 ↓ 0.0 0

Sort (cost=1.05..1.06 rows=1 width=8) (never executed)

  • Sort Key: brk_1.breakvalue DESC
21. 0.000 0.000 ↓ 0.0 0

Seq Scan on fil_processingtime_break brk_1 (cost=0.00..1.04 rows=1 width=8) (never executed)

  • Filter: ((movementqty >= breakvalue) AND (fil_processingtime_id = fil_processingtime_id))
22. 0.000 0.000 ↓ 0.0 0

Limit (cost=1.05..1.06 rows=1 width=8) (never executed)

23. 0.000 0.000 ↓ 0.0 0

Sort (cost=1.05..1.06 rows=1 width=8) (never executed)

  • Sort Key: brk_2.breakvalue DESC
24. 0.000 0.000 ↓ 0.0 0

Seq Scan on fil_processingtime_break brk_2 (cost=0.00..1.04 rows=1 width=8) (never executed)

  • Filter: ((movementqty >= breakvalue) AND (fil_processingtime_id = fil_processingtime_id))
25. 0.000 0.000 ↓ 0.0 0

Limit (cost=1.05..1.06 rows=1 width=8) (never executed)

26. 0.000 0.000 ↓ 0.0 0

Sort (cost=1.05..1.06 rows=1 width=8) (never executed)

  • Sort Key: brk_3.breakvalue DESC
27. 0.000 0.000 ↓ 0.0 0

Seq Scan on fil_processingtime_break brk_3 (cost=0.00..1.04 rows=1 width=8) (never executed)

  • Filter: ((movementqty >= breakvalue) AND (fil_processingtime_id = fil_processingtime_id))
28. 0.000 0.000 ↓ 0.0 0

Limit (cost=1.05..1.06 rows=1 width=8) (never executed)

29. 0.000 0.000 ↓ 0.0 0

Sort (cost=1.05..1.06 rows=1 width=8) (never executed)

  • Sort Key: brk_4.breakvalue DESC
30. 0.000 0.000 ↓ 0.0 0

Seq Scan on fil_processingtime_break brk_4 (cost=0.00..1.04 rows=1 width=8) (never executed)

  • Filter: ((movementqty >= breakvalue) AND (fil_processingtime_id = fil_processingtime_id))
31. 0.000 0.000 ↓ 0.0 0

Result (cost=0.00..0.53 rows=1 width=0) (never executed)

  • One-Time Filter: false
32. 0.003 19.516 ↓ 0.0 0 1

Hash (cost=447.71..447.71 rows=55 width=7) (actual time=19.516..19.516 rows=0 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 8kB
33. 0.101 19.513 ↑ 55.0 1 1

HashAggregate (cost=447.16..447.71 rows=55 width=7) (actual time=19.511..19.513 rows=1 loops=1)

  • Group Key: refline.fil_orderline_id
34. 0.393 19.412 ↓ 1.4 77 1

Nested Loop (cost=153.74..447.03 rows=55 width=7) (actual time=14.762..19.412 rows=77 loops=1)

35. 9.119 18.557 ↓ 1.4 77 1

Hash Join (cost=153.45..410.36 rows=55 width=7) (actual time=14.733..18.557 rows=77 loops=1)

  • Hash Cond: (l.m_package_id = p.m_package_id)
36. 7.753 7.753 ↑ 1.0 6,426 1

Seq Scan on m_packageline l (cost=0.00..232.26 rows=6,426 width=13) (actual time=0.006..7.753 rows=6,426 loops=1)

37. 0.050 1.685 ↑ 1.0 24 1

Hash (cost=153.15..153.15 rows=24 width=6) (actual time=1.685..1.685 rows=24 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 9kB
38. 1.635 1.635 ↑ 1.0 24 1

Seq Scan on m_package p (cost=0.00..153.15 rows=24 width=6) (actual time=1.356..1.635 rows=24 loops=1)

  • Filter: (r_request_id = '1001225'::numeric)
  • Rows Removed by Filter: 2,788
39. 0.462 0.462 ↑ 1.0 1 77

Index Scan using c_orderline_pkey on c_orderline refline (cost=0.29..0.66 rows=1 width=13) (actual time=0.004..0.006 rows=1 loops=77)

  • Index Cond: (c_orderline_id = l.c_orderline_id)
Planning time : 1.923 ms
Execution time : 19.808 ms