explain.depesz.com

PostgreSQL's explain analyze made readable

Result: SYTt : Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: Optimization for: replenishment; plan #5LIH; plan #BNVh; plan #9C6; plan #CDvl; plan #o8ML; plan #cTxEO; plan #4jYJ; plan #Gzo1; plan #MV4a; plan #9OZe; plan #VELI

Settings

Optimization path:

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 51.807 1,242.992 ↑ 7,362.0 1 1

Nested Loop Semi Join (cost=47.22..93,131.26 rows=7,362 width=378) (actual time=31.698..1,242.992 rows=1 loops=1)

  • Join Filter: (line.ref_orderline_id = ol.c_orderline_id)
  • Rows Removed by Join Filter: 14,378
2. 28.149 1,162.427 ↑ 1.0 14,379 1

Append (cost=46.94..92,310.61 rows=14,723 width=96) (actual time=3.429..1,162.427 rows=14,379 loops=1)

3. 1.677 29.105 ↓ 1.0 446 1

Hash Join (cost=46.94..966.80 rows=445 width=91) (actual time=3.427..29.105 rows=446 loops=1)

  • Hash Cond: (line.m_requisition_id = req.m_requisition_id)
4. 13.346 26.088 ↓ 1.0 446 1

Hash Right Join (cost=24.01..706.36 rows=445 width=82) (actual time=2.071..26.088 rows=446 loops=1)

  • Hash Cond: (poline.c_orderline_id = line.c_orderline_id)
5. 11.351 11.351 ↑ 1.0 9,132 1

Seq Scan on c_orderline poline (cost=0.00..631.65 rows=9,365 width=12) (actual time=0.004..11.351 rows=9,132 loops=1)

6. 0.725 1.391 ↓ 1.0 446 1

Hash (cost=18.45..18.45 rows=445 width=77) (actual time=1.391..1.391 rows=446 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 63kB
7. 0.666 0.666 ↓ 1.0 446 1

Seq Scan on m_requisitionline line (cost=0.00..18.45 rows=445 width=77) (actual time=0.005..0.666 rows=446 loops=1)

8. 0.668 1.340 ↓ 1.0 442 1

Hash (cost=17.41..17.41 rows=441 width=15) (actual time=1.340..1.340 rows=442 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 30kB
9. 0.672 0.672 ↓ 1.0 442 1

Seq Scan on m_requisition req (cost=0.00..17.41 rows=441 width=15) (actual time=0.006..0.672 rows=442 loops=1)

10. 32.601 1,094.020 ↑ 1.0 12,603 1

Subquery Scan on *SELECT* 2 (cost=2,481.54..90,498.64 rows=12,953 width=97) (actual time=136.881..1,094.020 rows=12,603 loops=1)

11. 310.315 1,061.419 ↑ 1.0 12,603 1

Hash Join (cost=2,481.54..90,369.11 rows=12,953 width=97) (actual time=136.877..1,061.419 rows=12,603 loops=1)

  • Hash Cond: (line_1.m_product_id = product.m_product_id)
12. 40.502 120.793 ↑ 1.0 12,603 1

Hash Join (cost=718.84..3,165.19 rows=12,953 width=99) (actual time=42.756..120.793 rows=12,603 loops=1)

  • Hash Cond: (line_1.m_production_id = prod.m_production_id)
13. 37.570 37.570 ↑ 1.0 12,603 1

Seq Scan on m_productionline line_1 (cost=0.00..2,268.24 rows=12,953 width=63) (actual time=0.007..37.570 rows=12,603 loops=1)

  • Filter: ((isendproduct = 'Y'::bpchar) AND (ismanual = 'N'::bpchar))
  • Rows Removed by Filter: 40,013
14. 19.643 42.721 ↓ 1.0 12,794 1

Hash (cost=558.93..558.93 rows=12,793 width=42) (actual time=42.721..42.721 rows=12,794 loops=1)

  • Buckets: 16,384 Batches: 1 Memory Usage: 996kB
15. 23.078 23.078 ↓ 1.0 12,794 1

Seq Scan on m_production prod (cost=0.00..558.93 rows=12,793 width=42) (actual time=0.006..23.078 rows=12,794 loops=1)

16. 41.942 93.892 ↑ 1.0 26,831 1

Hash (cost=1,427.31..1,427.31 rows=26,831 width=11) (actual time=93.892..93.892 rows=26,831 loops=1)

  • Buckets: 32,768 Batches: 1 Memory Usage: 1,314kB
17. 51.950 51.950 ↑ 1.0 26,831 1

Seq Scan on m_product product (cost=0.00..1,427.31 rows=26,831 width=11) (actual time=0.008..51.950 rows=26,831 loops=1)

18.          

SubPlan (for Hash Join)

19. 50.412 189.045 ↑ 1.0 1 12,603

Limit (cost=1.05..1.06 rows=1 width=64) (actual time=0.014..0.015 rows=1 loops=12,603)

20. 75.618 138.633 ↑ 1.0 1 12,603

Sort (cost=1.05..1.06 rows=1 width=64) (actual time=0.011..0.011 rows=1 loops=12,603)

  • Sort Key: brk.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
21. 63.015 63.015 ↑ 1.0 1 12,603

Seq Scan on fil_processingtime_break brk (cost=0.00..1.04 rows=1 width=64) (actual time=0.003..0.005 rows=1 loops=12,603)

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
  • Rows Removed by Filter: 2
22. 8.776 35.104 ↑ 1.0 1 2,194

Limit (cost=1.05..1.06 rows=1 width=64) (actual time=0.015..0.016 rows=1 loops=2,194)

23. 15.358 26.328 ↑ 1.0 1 2,194

Sort (cost=1.05..1.06 rows=1 width=64) (actual time=0.012..0.012 rows=1 loops=2,194)

  • Sort Key: brk_1.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
24. 10.970 10.970 ↑ 1.0 1 2,194

Seq Scan on fil_processingtime_break brk_1 (cost=0.00..1.04 rows=1 width=64) (actual time=0.003..0.005 rows=1 loops=2,194)

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
  • Rows Removed by Filter: 2
25. 41.636 156.135 ↑ 1.0 1 10,409

Limit (cost=1.05..1.06 rows=1 width=64) (actual time=0.014..0.015 rows=1 loops=10,409)

26. 62.454 114.499 ↑ 1.0 1 10,409

Sort (cost=1.05..1.06 rows=1 width=64) (actual time=0.011..0.011 rows=1 loops=10,409)

  • Sort Key: brk_2.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
27. 52.045 52.045 ↑ 1.0 1 10,409

Seq Scan on fil_processingtime_break brk_2 (cost=0.00..1.04 rows=1 width=64) (actual time=0.003..0.005 rows=1 loops=10,409)

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
  • Rows Removed by Filter: 2
28. 0.000 0.000 ↓ 0.0 0

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

29. 0.000 0.000 ↓ 0.0 0

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

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

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

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
31. 41.636 156.135 ↑ 1.0 1 10,409

Limit (cost=1.05..1.06 rows=1 width=64) (actual time=0.014..0.015 rows=1 loops=10,409)

32. 72.863 114.499 ↑ 1.0 1 10,409

Sort (cost=1.05..1.06 rows=1 width=64) (actual time=0.011..0.011 rows=1 loops=10,409)

  • Sort Key: brk_4.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
33. 41.636 41.636 ↑ 1.0 1 10,409

Seq Scan on fil_processingtime_break brk_4 (cost=0.00..1.04 rows=1 width=64) (actual time=0.003..0.004 rows=1 loops=10,409)

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
  • Rows Removed by Filter: 2
34. 5.133 11.153 ↓ 1.0 1,330 1

Hash Join (cost=72.43..827.47 rows=1,325 width=90) (actual time=4.400..11.153 rows=1,330 loops=1)

  • Hash Cond: (line_2.m_movement_id = mov.m_movement_id)
35. 1.665 1.665 ↓ 1.0 1,374 1

Seq Scan on m_movementline line_2 (cost=0.00..47.67 rows=1,367 width=55) (actual time=0.005..1.665 rows=1,374 loops=1)

36. 2.003 4.355 ↑ 1.0 1,247 1

Hash (cost=56.46..56.46 rows=1,277 width=41) (actual time=4.355..4.355 rows=1,247 loops=1)

  • Buckets: 2,048 Batches: 1 Memory Usage: 111kB
37. 2.352 2.352 ↑ 1.0 1,247 1

Seq Scan on m_movement mov (cost=0.00..56.46 rows=1,277 width=41) (actual time=0.009..2.352 rows=1,247 loops=1)

  • Filter: (docstatus <> 'VO'::bpchar)
  • Rows Removed by Filter: 44
38. 28.746 28.758 ↑ 3.0 1 14,379

Materialize (cost=0.29..10.90 rows=3 width=6) (actual time=0.001..0.002 rows=1 loops=14,379)

39. 0.012 0.012 ↑ 3.0 1 1

Index Scan using c_orderline_order on c_orderline ol (cost=0.29..10.88 rows=3 width=6) (actual time=0.010..0.012 rows=1 loops=1)

  • Index Cond: (c_order_id = '1002525'::numeric)
Planning time : 1.614 ms
Execution time : 1,243.243 ms