explain.depesz.com

PostgreSQL's explain analyze made readable

Result: H7Fg

Settings
# exclusive inclusive rows x rows loops node
1. 0.122 792.856 ↑ 1.0 30 1

Limit (cost=4,075.47..2,518,193.12 rows=30 width=747) (actual time=325.189..792.856 rows=30 loops=1)

2. 6.229 792.734 ↑ 143.3 30 1

Result (cost=4,075.47..360,277,134.44 rows=4,299 width=747) (actual time=325.179..792.734 rows=30 loops=1)

3. 18.535 306.625 ↑ 143.3 30 1

Sort (cost=4,075.47..4,086.22 rows=4,299 width=643) (actual time=306.485..306.625 rows=30 loops=1)

  • Sort Key: l.internal_reference_id DESC
  • Sort Method: top-N heapsort Memory: 44kB
4. 13.011 288.090 ↑ 1.0 4,299 1

Hash Join (cost=681.39..3,948.50 rows=4,299 width=643) (actual time=42.089..288.090 rows=4,299 loops=1)

  • Hash Cond: (l.id = lel.load_id)
5. 64.126 122.245 ↑ 1.0 5,143 1

Hash Join (cost=273.72..3,399.10 rows=5,143 width=1,115) (actual time=15.459..122.245 rows=5,143 loops=1)

  • Hash Cond: (v.id = l.vehicle_id)
6. 43.092 43.092 ↑ 1.0 101,960 1

Seq Scan on vehicle v (cost=0.00..2,691.60 rows=101,960 width=528) (actual time=0.076..43.092 rows=101,960 loops=1)

7. 7.547 15.027 ↑ 1.0 5,143 1

Hash (cost=209.43..209.43 rows=5,143 width=595) (actual time=15.027..15.027 rows=5,143 loops=1)

  • Buckets: 8192 Batches: 1 Memory Usage: 923kB
8. 7.480 7.480 ↑ 1.0 5,143 1

Seq Scan on load l (cost=0.00..209.43 rows=5,143 width=595) (actual time=0.071..7.480 rows=5,143 loops=1)

9. 4.951 19.565 ↑ 1.0 4,299 1

Hash (cost=353.94..353.94 rows=4,299 width=32) (actual time=19.565..19.565 rows=4,299 loops=1)

  • Buckets: 8192 Batches: 1 Memory Usage: 333kB
10. 14.614 14.614 ↑ 1.0 4,299 1

Seq Scan on load_execution_link lel (cost=0.00..353.94 rows=4,299 width=32) (actual time=0.089..14.614 rows=4,299 loops=1)

  • Filter: (shipper_business_id = '2121438735764555001'::bigint)
  • Rows Removed by Filter: 8096
11.          

SubPlan (for Hash Join)

12. 133.269 133.269 ↑ 1.0 1 4,299

Result (cost=0.00..0.01 rows=1 width=32) (actual time=0.030..0.031 rows=1 loops=4,299)

13.          

SubPlan (for Result)

14. 2.190 4.830 ↑ 8.0 1 30

Nested Loop Left Join (cost=6.71..699.49 rows=8 width=32) (actual time=0.157..0.161 rows=1 loops=30)

15. 1.530 1.530 ↑ 1.0 1 30

Index Scan using idx_execution_bid_order_id on execution e (cost=0.29..8.30 rows=1 width=32) (actual time=0.049..0.051 rows=1 loops=30)

  • Index Cond: (id = lel.execution_id)
16. 0.420 1.110 ↑ 275.0 1 30

Bitmap Heap Scan on posting p (cost=6.42..688.42 rows=275 width=21) (actual time=0.036..0.037 rows=1 loops=30)

  • Recheck Cond: (id = e.posting_id)
  • Heap Blocks: exact=30
17. 0.690 0.690 ↑ 275.0 1 30

Bitmap Index Scan on idx_posting_id (cost=0.00..6.35 rows=275 width=0) (actual time=0.023..0.023 rows=1 loops=30)

  • Index Cond: (id = e.posting_id)
18. 2.730 2.730 ↓ 0.0 0 30

Seq Scan on shipper_business sb (cost=0.00..6.53 rows=1 width=32) (actual time=0.091..0.091 rows=0 loops=30)

  • Filter: (lel.shipper_business_id = id)
  • Rows Removed by Filter: 202
19. 138.750 138.750 ↑ 1.0 1 30

Seq Scan on carrier_business cb (cost=0.00..358.14 rows=1 width=32) (actual time=0.873..4.625 rows=1 loops=30)

  • Filter: (lel.carrier_business_id = id)
  • Rows Removed by Filter: 9610
20. 312.159 333.570 ↑ 342.5 2 30

Index Scan using idx_stop_parent on stop s (cost=0.42..82,739.74 rows=685 width=32) (actual time=1.564..11.119 rows=2 loops=30)

  • Index Cond: (l.id = parent_id)
21.          

SubPlan (for Index Scan)

22. 4.392 6.588 ↑ 1.0 1 61

Nested Loop (cost=0.70..16.75 rows=1 width=32) (actual time=0.106..0.108 rows=1 loops=61)

23. 1.220 1.220 ↑ 1.0 1 61

Index Scan using idx_address_link_parent_id_parent_type on address_link al (cost=0.42..8.44 rows=1 width=8) (actual time=0.019..0.020 rows=1 loops=61)

  • Index Cond: (s.id = parent_id)
24. 0.976 0.976 ↑ 1.0 1 61

Index Scan using address_pkey on address a (cost=0.28..8.30 rows=1 width=544) (actual time=0.015..0.016 rows=1 loops=61)

  • Index Cond: (id = al.address_id)
25. 6.875 12.993 ↑ 2.2 4 61

Index Scan using idx_consignment_stop_id on consignment c (cost=0.42..89.01 rows=9 width=32) (actual time=0.077..0.213 rows=4 loops=61)

  • Index Cond: (s.id = stop_id)
26.          

SubPlan (for Index Scan)

27. 6.118 6.118 ↑ 1.0 1 266

Index Scan using good_pkey on good g (cost=0.42..8.44 rows=1 width=32) (actual time=0.022..0.023 rows=1 loops=266)

  • Index Cond: (c.good_id = id)
28. 1.830 1.830 ↑ 1.0 1 61

Index Scan using idx_facility_id_status on facility f (cost=0.29..8.31 rows=1 width=32) (actual time=0.029..0.030 rows=1 loops=61)

  • Index Cond: (s.facility_id = id)
Planning time : 140.969 ms
Execution time : 800.003 ms