explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Xpnn

Settings
# exclusive inclusive rows x rows loops node
1. 0.087 1,225.372 ↑ 224.0 120 1

Sort (cost=92,387.11..92,454.31 rows=26,880 width=532) (actual time=1,225.358..1,225.372 rows=120 loops=1)

  • Sort Key: (date_trunc('day'::text, r.date_reponse)) DESC
  • Sort Method: quicksort Memory: 34kB
2. 99.409 1,225.285 ↑ 224.0 120 1

HashAggregate (cost=90,073.51..90,409.51 rows=26,880 width=532) (actual time=1,225.222..1,225.285 rows=120 loops=1)

  • Group Key: date_trunc('day'::text, r.date_reponse), COALESCE(rm.code, rf.code)
3. 146.050 1,125.876 ↑ 1.1 381,712 1

Hash Left Join (cost=27,297.50..86,839.79 rows=431,163 width=524) (actual time=286.922..1,125.876 rows=381,712 loops=1)

  • Hash Cond: (i.motif_demande_id = rm.id)
4. 95.125 979.807 ↑ 1.1 381,712 1

Hash Join (cost=27,296.03..79,831.92 rows=431,163 width=21) (actual time=286.882..979.807 rows=381,712 loops=1)

  • Hash Cond: (b.fichier_recu_brpp_id = r.id)
5. 80.608 884.647 ↑ 1.0 431,163 1

Hash Left Join (cost=27,292.23..74,407.11 rows=431,163 width=17) (actual time=286.780..884.647 rows=431,163 loops=1)

  • Hash Cond: (b.pivot_id = p.id)
6. 435.474 709.084 ↑ 1.0 431,163 1

Hash Right Join (cost=18,751.17..63,585.05 rows=431,163 width=12) (actual time=191.426..709.084 rows=431,163 loops=1)

  • Hash Cond: (i.id = b.demande_inscription_id)
7. 83.844 83.844 ↓ 1.0 732,564 1

Seq Scan on demande_inscription i (cost=0.00..38,440.19 rows=732,319 width=8) (actual time=0.008..83.844 rows=732,564 loops=1)

8. 77.127 189.766 ↑ 1.0 431,163 1

Hash (cost=13,361.63..13,361.63 rows=431,163 width=12) (actual time=189.766..189.766 rows=431,163 loops=1)

  • Buckets: 524288 Batches: 1 Memory Usage: 20746kB
9. 112.639 112.639 ↑ 1.0 431,163 1

Seq Scan on demande_brpp b (cost=0.00..13,361.63 rows=431,163 width=12) (actual time=0.005..112.639 rows=431,163 loops=1)

10. 20.253 94.955 ↑ 1.0 117,178 1

Hash (cost=7,076.34..7,076.34 rows=117,178 width=13) (actual time=94.955..94.955 rows=117,178 loops=1)

  • Buckets: 131072 Batches: 1 Memory Usage: 5667kB
11. 26.050 74.702 ↑ 1.0 117,178 1

Hash Left Join (cost=1.36..7,076.34 rows=117,178 width=13) (actual time=0.036..74.702 rows=117,178 loops=1)

  • Hash Cond: (p.finalite_id = rf.id)
12. 48.636 48.636 ↑ 1.0 117,178 1

Seq Scan on pivot p (cost=0.00..5,463.78 rows=117,178 width=8) (actual time=0.007..48.636 rows=117,178 loops=1)

13. 0.008 0.016 ↑ 1.0 16 1

Hash (cost=1.16..1.16 rows=16 width=13) (actual time=0.016..0.016 rows=16 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
14. 0.008 0.008 ↑ 1.0 16 1

Seq Scan on r_finalite rf (cost=0.00..1.16 rows=16 width=13) (actual time=0.004..0.008 rows=16 loops=1)

15. 0.016 0.035 ↑ 1.0 80 1

Hash (cost=2.80..2.80 rows=80 width=12) (actual time=0.035..0.035 rows=80 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 12kB
16. 0.019 0.019 ↑ 1.0 80 1

Seq Scan on fichier_recu_brpp r (cost=0.00..2.80 rows=80 width=12) (actual time=0.006..0.019 rows=80 loops=1)

17. 0.010 0.019 ↑ 1.0 21 1

Hash (cost=1.21..1.21 rows=21 width=10) (actual time=0.019..0.019 rows=21 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
18. 0.009 0.009 ↑ 1.0 21 1

Seq Scan on r_motif_demande rm (cost=0.00..1.21 rows=21 width=10) (actual time=0.007..0.009 rows=21 loops=1)