explain.depesz.com

PostgreSQL's explain analyze made readable

Result: dPvI

Settings
# exclusive inclusive rows x rows loops node
1. 0.000 16,045.897 ↑ 1.0 1,500 1

Limit (cost=1,149,697.04..1,149,872.05 rows=1,500 width=96) (actual time=16,045.545..16,045.897 rows=1,500 loops=1)

2. 529.111 16,538.260 ↑ 5,555.5 1,500 1

Gather Merge (cost=1,149,697.04..2,121,975.32 rows=8,333,232 width=96) (actual time=16,045.544..16,538.260 rows=1,500 loops=1)

  • Workers Planned: 2
  • Workers Launched: 2
3. 1,200.045 16,009.149 ↑ 4,884.7 853 3 / 3

Sort (cost=1,148,697.02..1,159,113.56 rows=4,166,616 width=96) (actual time=16,009.116..16,009.149 rows=853 loops=3)

  • Sort Key: m.partition_id, m.bet_id, m.selection_id
  • Sort Method: top-N heapsort Memory: 307kB
  • Worker 0: Sort Method: top-N heapsort Memory: 307kB
  • Worker 1: Sort Method: top-N heapsort Memory: 307kB
4. 4,466.644 14,809.104 ↑ 1.4 2,882,477 3 / 3

Parallel Hash Left Join (cost=636,677.05..908,059.39 rows=4,166,616 width=96) (actual time=11,553.383..14,809.104 rows=2,882,477 loops=3)

  • Hash Cond: ((b.partition_id = s.partition_id) AND (b.bet_id = s.bet_id))
5. 1,101.497 1,101.497 ↑ 1.2 2,107,369 3 / 3

Parallel Seq Scan on bet_odds_cache_p01 b (cost=0.00..117,222.47 rows=2,634,198 width=59) (actual time=0.015..1,101.497 rows=2,107,369 loops=3)

  • Filter: (partition_id = 1)
6. 1,518.873 9,240.963 ↑ 1.2 3,333,333 3 / 3

Parallel Hash (cost=533,487.81..533,487.81 rows=4,166,616 width=49) (actual time=9,240.963..9,240.963 rows=3,333,333 loops=3)

  • Buckets: 262,144 Batches: 64 Memory Usage: 13,216kB
7. 4,066.042 7,722.090 ↑ 1.2 3,333,333 3 / 3

Parallel Hash Left Join (cost=236,815.23..533,487.81 rows=4,166,616 width=49) (actual time=5,033.187..7,722.090 rows=3,333,333 loops=3)

  • Hash Cond: ((s.partition_id = m.partition_id) AND (s.bet_id = m.bet_id) AND (s.selection_id = m.selection_id))
8. 1,126.996 1,126.996 ↑ 1.2 3,333,333 3 / 3

Parallel Seq Scan on bet_odds_selection_cache_p01 s (cost=0.00..125,612.70 rows=4,166,616 width=23) (actual time=0.051..1,126.996 rows=3,333,333 loops=3)

  • Filter: (partition_id = 1)
9. 1,329.549 2,529.052 ↑ 1.2 3,333,333 3 / 3

Parallel Hash (cost=135,416.59..135,416.59 rows=4,166,608 width=26) (actual time=2,529.052..2,529.052 rows=3,333,333 loops=3)

  • Buckets: 524,288 Batches: 64 Memory Usage: 13,952kB
10. 1,199.503 1,199.503 ↑ 1.2 3,333,333 3 / 3

Parallel Seq Scan on live_to_prematch_cache_p01 m (cost=0.00..135,416.59 rows=4,166,608 width=26) (actual time=0.080..1,199.503 rows=3,333,333 loops=3)

  • Filter: (partition_id = 1)
Planning time : 0.429 ms
Execution time : 16,538.635 ms