explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 4jYJ : 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

Settings

Optimization path:

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 30.407 1,199.467 ↑ 1.0 14,379 1

Result (cost=50.75..92,461.66 rows=14,723 width=378) (actual time=3.495..1,199.467 rows=14,379 loops=1)

  • One-Time Filter: $0
2.          

Initplan (for Result)

3. 0.041 0.041 ↑ 3.0 1 1

Index Only Scan using c_orderline_order on c_orderline (cost=0.29..10.88 rows=3 width=0) (actual time=0.041..0.041 rows=1 loops=1)

  • Index Cond: (c_order_id = '1002525'::numeric)
  • Heap Fetches: 1
4. 28.263 1,169.019 ↑ 1.0 14,379 1

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

5. 1.677 29.670 ↓ 1.0 446 1

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

  • Hash Cond: (line.m_requisition_id = req.m_requisition_id)
6. 13.402 26.663 ↓ 1.0 446 1

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

  • Hash Cond: (poline.c_orderline_id = line.c_orderline_id)
7. 11.849 11.849 ↑ 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.849 rows=9,132 loops=1)

8. 0.688 1.412 ↓ 1.0 446 1

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

  • Buckets: 1,024 Batches: 1 Memory Usage: 63kB
9. 0.724 0.724 ↓ 1.0 446 1

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

10. 0.666 1.330 ↓ 1.0 442 1

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

  • Buckets: 1,024 Batches: 1 Memory Usage: 30kB
11. 0.664 0.664 ↓ 1.0 442 1

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

12. 32.038 1,099.999 ↑ 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.386..1,099.999 rows=12,603 loops=1)

13. 315.844 1,067.961 ↑ 1.0 12,603 1

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

  • Hash Cond: (line_1.m_product_id = product.m_product_id)
14. 40.968 121.040 ↑ 1.0 12,603 1

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

  • Hash Cond: (line_1.m_production_id = prod.m_production_id)
15. 38.622 38.622 ↑ 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.008..38.622 rows=12,603 loops=1)

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

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

  • Buckets: 16,384 Batches: 1 Memory Usage: 996kB
17. 21.761 21.761 ↓ 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..21.761 rows=12,794 loops=1)

18. 42.360 94.658 ↑ 1.0 26,831 1

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

  • Buckets: 32,768 Batches: 1 Memory Usage: 1,314kB
19. 52.298 52.298 ↑ 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..52.298 rows=26,831 loops=1)

20.          

SubPlan (for Hash Join)

21. 37.809 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)

22. 88.221 151.236 ↑ 1.0 1 12,603

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

  • Sort Key: brk.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
23. 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
24. 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)

25. 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
26. 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
27. 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)

28. 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
29. 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
30. 0.000 0.000 ↓ 0.0 0

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

31. 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
32. 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))
33. 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)

34. 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_4.breakvalue DESC
  • Sort Method: quicksort Memory: 25kB
35. 52.045 52.045 ↑ 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.005 rows=1 loops=10,409)

  • Filter: ((line_1.movementqty >= breakvalue) AND (fil_processingtime_id = product.fil_processingtime_id))
  • Rows Removed by Filter: 2
36. 5.072 11.087 ↓ 1.0 1,330 1

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

  • Hash Cond: (line_2.m_movement_id = mov.m_movement_id)
37. 1.653 1.653 ↓ 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.004..1.653 rows=1,374 loops=1)

38. 2.002 4.362 ↑ 1.0 1,247 1

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

  • Buckets: 2,048 Batches: 1 Memory Usage: 111kB
39. 2.360 2.360 ↑ 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.360 rows=1,247 loops=1)

  • Filter: (docstatus <> 'VO'::bpchar)
  • Rows Removed by Filter: 44
Planning time : 1.544 ms
Execution time : 1,214.240 ms