explain.depesz.com

PostgreSQL's explain analyze made readable

Result: kqeM : explain

Settings
# exclusive inclusive rows x rows loops node
1. 0.000 91.880 ↑ 13.5 319 1

Finalize GroupAggregate (cost=12,260.51..12,850.45 rows=4,305 width=48) (actual time=87.559..91.880 rows=319 loops=1)

  • Group Key: ((((s.annee)::text || ' - '::text) || a.libelle))
  • Planning Time: 0.464 ms
  • Execution Time: 94.556 ms
2.          

Initplan (forFinalize GroupAggregate)

3. 0.002 0.002 ↑ 1.0 1 1

Result (cost=0.00..0.02 rows=1 width=8) (actual time=0.002..0.002 rows=1 loops=1)

4. 0.000 93.955 ↑ 3.7 957 1

Gather Merge (cost=12,260.49..12,737.42 rows=3,588 width=48) (actual time=87.534..93.955 rows=957 loops=1)

  • Workers Planned: 2
  • Params Evaluated: $0
  • Workers Launched: 2
5. 6.051 253.308 ↑ 5.6 319 3

Partial GroupAggregate (cost=11,260.46..11,323.25 rows=1,794 width=48) (actual time=81.830..84.436 rows=319 loops=3)

  • Group Key: ((((s.annee)::text || ' - '::text) || a.libelle))
6. 62.955 247.257 ↓ 3.1 5,596 3

Sort (cost=11,260.46..11,264.95 rows=1,794 width=40) (actual time=81.800..82.419 rows=5,596 loops=3)

  • Sort Key: ((((s.annee)::text || ' - '::text) || a.libelle))
  • Sort Method: quicksort Memory: 522kB
  • Worker 0: Sort Method: quicksort Memory: 404kB
  • Worker 1: Sort Method: quicksort Memory: 1081kB
7. 8.820 184.302 ↓ 3.1 5,596 3

Hash Left Join (cost=202.26..11,163.51 rows=1,794 width=40) (actual time=38.508..61.434 rows=5,596 loops=3)

  • Hash Cond: (v.appellation_id = a.id)
8. 5.658 174.939 ↓ 3.1 5,596 3

Hash Join (cost=192.08..11,130.61 rows=1,794 width=16) (actual time=38.300..58.313 rows=5,596 loops=3)

  • Hash Cond: (s.vin_id = v.id)
9. 160.392 160.488 ↓ 3.1 5,596 3

Hash Join (cost=1.07..10,934.89 rows=1,794 width=16) (actual time=35.333..53.496 rows=5,596 loops=3)

  • Hash Cond: (s.contenant_id = c.id)
  • -> Parallel Seq Scan on stock s (cost=0.00..10922.46 rows=1794 width=16) (actual time=35.210..51.597 rows=5596 loops
  • Filter: ((annee)::double precision = $0)
  • Rows Removed by Filter: 281415
10. 0.021 0.096 ↑ 1.0 3 3

Hash (cost=1.03..1.03 rows=3 width=8) (actual time=0.031..0.032 rows=3 loops=3)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
11. 0.075 0.075 ↑ 1.0 3 3

Seq Scan on contenant c (cost=0.00..1.03 rows=3 width=8) (actual time=0.023..0.025 rows=3 loops=3)

12. 4.488 8.793 ↑ 1.1 6,063 3

Hash (cost=105.45..105.45 rows=6,845 width=8) (actual time=2.931..2.931 rows=6,063 loops=3)

  • Buckets: 8192 Batches: 1 Memory Usage: 301kB
13. 4.305 4.305 ↑ 1.1 6,063 3

Seq Scan on vin v (cost=0.00..105.45 rows=6,845 width=8) (actual time=0.020..1.435 rows=6,063 loops=3)

14. 0.282 0.543 ↑ 1.0 319 3

Hash (cost=6.19..6.19 rows=319 width=20) (actual time=0.181..0.181 rows=319 loops=3)

  • Buckets: 1024 Batches: 1 Memory Usage: 25kB
15. 0.261 0.261 ↑ 1.0 319 3

Seq Scan on appellation a (cost=0.00..6.19 rows=319 width=20) (actual time=0.017..0.087 rows=319 loops=3)