explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Kgx2R

Settings
# exclusive inclusive rows x rows loops node
1. 7.675 127,500.910 ↑ 83,246.4 7 1

HashAggregate (cost=21,512,660.35..21,576,760.10 rows=582,725 width=125) (actual time=127,494.601..127,500.910 rows=7 loops=1)

  • Group Key: road_movements.trip_id, (road_movements.mov_cst * '2'::real)
2.          

CTE boundaries

3. 0.000 0.000 ↓ 0.0 0

Seq Scan on v_transit_boundaries (cost=0.00..1,218.40 rows=3,404 width=78,632) (never executed)

4. 0.000 127,493.235 ↑ 1,689.5 3,167 1

Nested Loop Left Join (cost=143,930.16..21,484,689.25 rows=5,350,541 width=121) (actual time=3,469.648..127,493.235 rows=3,167 loops=1)

  • Join Filter: NULL::boolean
5. 68.560 127,532.053 ↑ 1,689.5 3,167 1

Gather (cost=143,930.16..20,936,258.79 rows=5,350,541 width=117) (actual time=3,469.638..127,532.053 rows=3,167 loops=1)

  • Workers Planned: 4
  • Workers Launched: 4
6. 4.508 127,463.493 ↑ 2,113.2 633 5 / 5

Parallel Hash Join (cost=142,930.16..20,400,204.69 rows=1,337,635 width=117) (actual time=13,306.683..127,463.493 rows=633 loops=5)

  • Hash Cond: (road_segments.link_id = v_transit_roads.link_id)
7. 3.189 126,097.517 ↑ 2,113.2 633 5 / 5

Parallel Hash Join (cost=70,557.29..20,324,320.33 rows=1,337,635 width=125) (actual time=11,942.829..126,097.517 rows=633 loops=5)

  • Hash Cond: (road_segments.trip_id = road_movements.trip_id)
8. 14,353.107 125,203.399 ↑ 42,843.2 633 5 / 5

Parallel Hash Join (cost=5,730.17..20,188,299.04 rows=27,119,777 width=24) (actual time=11,050.452..125,203.399 rows=633 loops=5)

  • Hash Cond: (road_segments.trip_id = road_segments_1.trip_id)
9. 110,849.875 110,849.875 ↑ 1.3 118,754,299 5 / 5

Parallel Seq Scan on road_segments (cost=0.00..19,792,384.00 rows=148,442,880 width=16) (actual time=0.059..110,849.875 rows=118,754,299 loops=5)

10. 0.155 0.417 ↑ 2,188.0 1 5 / 5

Parallel Hash (cost=5,505.90..5,505.90 rows=2,188 width=8) (actual time=0.417..0.417 rows=1 loops=5)

  • Buckets: 8192 Batches: 1 Memory Usage: 192kB
11. 0.237 0.262 ↑ 2,188.0 1 5 / 5

Parallel Bitmap Heap Scan on road_segments road_segments_1 (cost=32.64..5,505.90 rows=2,188 width=8) (actual time=0.240..0.262 rows=1 loops=5)

  • Recheck Cond: (link_id = 1201710493)
12. 0.025 0.025 ↑ 750.1 7 1 / 5

Bitmap Index Scan on idx_road_segments_link_id (cost=0.00..31.33 rows=5,251 width=0) (actual time=0.126..0.126 rows=7 loops=1)

  • Index Cond: (link_id = 1201710493)
13. 128.249 890.929 ↑ 1.6 116,545 5 / 5

Parallel Hash (cost=45,559.58..45,559.58 rows=187,976 width=117) (actual time=890.928..890.929 rows=116,545 loops=5)

  • Buckets: 1048576 Batches: 1 Memory Usage: 103840kB
14. 762.680 762.680 ↑ 1.6 116,545 5 / 5

Parallel Seq Scan on road_movements (cost=0.00..45,559.58 rows=187,976 width=117) (actual time=13.651..762.680 rows=116,545 loops=5)

15. 78.555 1,361.468 ↑ 1.2 174,222 5 / 5

Parallel Hash (cost=50,050.73..50,050.73 rows=217,777 width=8) (actual time=1,361.467..1,361.468 rows=174,222 loops=5)

  • Buckets: 1048576 Batches: 1 Memory Usage: 42368kB
16. 1,282.913 1,282.913 ↑ 1.2 174,222 5 / 5

Parallel Seq Scan on v_transit_roads (cost=0.00..50,050.73 rows=217,777 width=8) (actual time=6.804..1,282.913 rows=174,222 loops=5)

17. 0.000 0.000 ↓ 0.0 0 3,167

Result (cost=0.00..0.00 rows=0 width=0) (actual time=0.000..0.000 rows=0 loops=3,167)

  • One-Time Filter: false
Planning time : 7.725 ms