explain.depesz.com

PostgreSQL's explain analyze made readable

Result: eH59 : Optimization for: replenishment; plan #5LIH

Settings

Optimization path:

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 0.004 0.148 ↓ 0.0 0 1

Append (cost=0.84..52.17 rows=3 width=32) (actual time=0.148..0.148 rows=0 loops=1)

2. 0.003 0.139 ↓ 0.0 0 1

Nested Loop (cost=0.84..45.02 rows=1 width=97) (actual time=0.139..0.139 rows=0 loops=1)

3. 0.002 0.136 ↓ 0.0 0 1

Nested Loop (cost=0.56..36.19 rows=1 width=91) (actual time=0.136..0.136 rows=0 loops=1)

4. 0.002 0.134 ↓ 0.0 0 1

Nested Loop (cost=0.29..27.89 rows=1 width=82) (actual time=0.134..0.134 rows=0 loops=1)

5. 0.132 0.132 ↓ 0.0 0 1

Seq Scan on m_requisitionline line (cost=0.00..19.57 rows=1 width=77) (actual time=0.132..0.132 rows=0 loops=1)

  • Filter: (c_orderline_id = '1009603'::numeric)
  • Rows Removed by Filter: 446
6. 0.000 0.000 ↓ 0.0 0

Index Scan using c_orderline_pkey on c_orderline poline (cost=0.29..8.30 rows=1 width=12) (never executed)

  • Index Cond: (c_orderline_id = '1009603'::numeric)
7. 0.000 0.000 ↓ 0.0 0

Index Scan using m_requisition_pkey on m_requisition req (cost=0.27..8.29 rows=1 width=15) (never executed)

  • Index Cond: (m_requisition_id = line.m_requisition_id)
8. 0.000 0.000 ↓ 0.0 0

Index Scan using c_orderline_pkey on c_orderline coline (cost=0.29..8.30 rows=1 width=12) (never executed)

  • Index Cond: (c_orderline_id = line.ref_orderline_id)
9. 0.002 0.003 ↓ 0.0 0 1

Subquery Scan on *SELECT* 2 (cost=0.00..6.60 rows=1 width=0) (actual time=0.003..0.003 rows=0 loops=1)

10. 0.001 0.001 ↓ 0.0 0 1

Result (cost=0.00..6.59 rows=1 width=0) (actual time=0.001..0.001 rows=0 loops=1)

  • One-Time Filter: false
11.          

SubPlan (for Result)

12. 0.000 0.000 ↓ 0.0 0

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

13. 0.000 0.000 ↓ 0.0 0

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

  • Sort Key: brk.breakvalue DESC
14. 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))
15. 0.000 0.000 ↓ 0.0 0

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

16. 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
17. 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))
18. 0.000 0.000 ↓ 0.0 0

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

19. 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
20. 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))
21. 0.000 0.000 ↓ 0.0 0

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

22. 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
23. 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))
24. 0.000 0.000 ↓ 0.0 0

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

25. 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
26. 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))
27. 0.002 0.002 ↓ 0.0 0 1

Result (cost=0.00..0.53 rows=1 width=0) (actual time=0.002..0.002 rows=0 loops=1)

  • One-Time Filter: false
Planning time : 1.557 ms
Execution time : 0.350 ms