explain.depesz.com

PostgreSQL's explain analyze made readable

Result: bNd2

Settings
# exclusive inclusive rows x rows loops node
1. 0.031 0.147 ↑ 279,849.1 53 1

Sort (cost=10,283,903.36..10,320,983.36 rows=14,832,000 width=421) (actual time=0.145..0.147 rows=53 loops=1)

  • Sort Key: ladder.""endDate"" DESC, ladder.name
  • Sort Method: quicksort Memory: 39kB
2. 0.016 0.116 ↑ 279,849.1 53 1

Hash Left Join (cost=66.44..435.78 rows=14,832,000 width=421) (actual time=0.059..0.116 rows=53 loops=1)

  • Hash Cond: (ladder.id = ""ladderPassword"".""ladderId"")
3. 0.015 0.098 ↑ 2,565.3 53 1

Hash Left Join (cost=29.44..40.63 rows=135,960 width=420) (actual time=0.055..0.098 rows=53 loops=1)

  • Hash Cond: (ladder.id = ""entryFee"".""ladderId"")
4. 0.015 0.080 ↑ 42.8 53 1

Merge Left Join (cost=4.59..9.80 rows=2,266 width=326) (actual time=0.050..0.080 rows=53 loops=1)

  • Merge Cond: (ladder.id = registration.""ladderId"")
5. 0.012 0.059 ↓ 1.1 21 1

Merge Left Join (cost=4.44..4.76 rows=20 width=290) (actual time=0.047..0.059 rows=21 loops=1)

  • Merge Cond: (ladder.id = prize.""ladderId"")
6. 0.009 0.039 ↓ 1.8 21 1

Sort (cost=2.88..2.91 rows=12 width=165) (actual time=0.038..0.039 rows=21 loops=1)

  • Sort Key: ladder.id
  • Sort Method: quicksort Memory: 30kB
7. 0.013 0.030 ↓ 1.8 21 1

Hash Right Join (cost=1.22..2.67 rows=12 width=165) (actual time=0.020..0.030 rows=21 loops=1)

  • Hash Cond: (""gameParameter"".""ladderId"" = ladder.id)
8. 0.005 0.005 ↓ 1.2 38 1

Seq Scan on ladder_game_parameter ""gameParameter"" (cost=0.00..1.33 rows=33 width=20) (actual time=0.003..0.005 rows=38 loops=1)

9. 0.003 0.012 ↓ 1.5 6 1

Hash (cost=1.17..1.17 rows=4 width=145) (actual time=0.012..0.012 rows=6 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 9kB
10. 0.009 0.009 ↓ 1.5 6 1

Seq Scan on ladder (cost=0.00..1.17 rows=4 width=145) (actual time=0.006..0.009 rows=6 loops=1)

  • Filter: ((""deletedOn"" IS NULL) AND (state = ANY ('{validating,done}'::ladders.ladder_state_enum[])) AND ((""gameSlug"")::text = 'warzone'::text))
  • Rows Removed by Filter: 7
11. 0.005 0.008 ↓ 1.8 33 1

Sort (cost=1.56..1.60 rows=18 width=125) (actual time=0.007..0.008 rows=33 loops=1)

  • Sort Key: prize.""ladderId"
  • Sort Method: quicksort Memory: 26kB
12. 0.003 0.003 ↑ 1.0 18 1

Seq Scan on ladder_prize prize (cost=0.00..1.18 rows=18 width=125) (actual time=0.002..0.003 rows=18 loops=1)

13. 0.006 0.006 ↑ 38.5 33 1

Index Scan using ""UQ_ae9df163e90cadf2af68dbf21a1"" on ladder_registration registration (cost=0.15..52.04 rows=1,270 width=36) (actual time=0.002..0.006 rows=33 loops=1)

14. 0.001 0.003 ↑ 660.0 1 1

Hash (cost=16.60..16.60 rows=660 width=94) (actual time=0.003..0.003 rows=1 loops=1)

  • Buckets: 1,024 Batches: 1 Memory Usage: 9kB
15. 0.002 0.002 ↑ 660.0 1 1

Seq Scan on ladder_entry_fee ""entryFee"" (cost=0.00..16.60 rows=660 width=94) (actual time=0.002..0.002 rows=1 loops=1)

16. 0.000 0.002 ↑ 1,200.0 1 1

Hash (cost=22.00..22.00 rows=1,200 width=40) (actual time=0.002..0.002 rows=1 loops=1)

  • Buckets: 2,048 Batches: 1 Memory Usage: 17kB
17. 0.002 0.002 ↑ 1,200.0 1 1

Seq Scan on ladder_password ""ladderPassword"" (cost=0.00..22.00 rows=1,200 width=40) (actual time=0.002..0.002 rows=1 loops=1)

Planning time : 0.495 ms
Execution time : 0.209 ms