explain.depesz.com

PostgreSQL's explain analyze made readable

Result: B2fO

Settings
# exclusive inclusive rows x rows loops node
1. 0.020 2,780.008 ↑ 200.0 1 1

Sort (cost=120,065.99..120,066.49 rows=200 width=10) (actual time=2,780.008..2,780.008 rows=1 loops=1)

  • Sort Key: (count(*)) DESC
  • Sort Method: quicksort Memory: 25kB
2. 0.000 2,779.988 ↑ 200.0 1 1

Finalize GroupAggregate (cost=120,007.68..120,058.35 rows=200 width=10) (actual time=2,779.988..2,779.988 rows=1 loops=1)

  • Group Key: s0198_transactions.store_key
3. 0.000 2,781.093 ↑ 133.3 3 1

Gather Merge (cost=120,007.68..120,054.35 rows=400 width=10) (actual time=2,779.980..2,781.093 rows=3 loops=1)

  • Workers Planned: 2
  • Workers Launched: 2
4. 0.099 8,322.063 ↑ 200.0 1 3

Sort (cost=119,007.65..119,008.15 rows=200 width=10) (actual time=2,774.020..2,774.021 rows=1 loops=3)

  • Sort Key: s0198_transactions.store_key
  • Sort Method: quicksort Memory: 25kB
  • Worker 0: Sort Method: quicksort Memory: 25kB
  • Worker 1: Sort Method: quicksort Memory: 25kB
5. 886.278 8,321.964 ↑ 200.0 1 3

Partial HashAggregate (cost=118,998.01..119,000.01 rows=200 width=10) (actual time=2,773.988..2,773.988 rows=1 loops=3)

  • Group Key: s0198_transactions.store_key
6. 643.982 7,435.686 ↑ 1.3 2,379,933 3

Parallel Append (cost=0.00..104,123.26 rows=2,974,951 width=2) (actual time=0.148..2,478.562 rows=2,379,933 loops=3)

7. 6,791.703 6,791.703 ↑ 1.3 2,379,933 3

Parallel Seq Scan on s0198_transactions (cost=0.00..89,248.50 rows=2,974,950 width=2) (actual time=0.147..2,263.901 rows=2,379,933 loops=3)

8. 0.001 0.001 ↓ 0.0 0 1

Parallel Seq Scan on transactions (cost=0.00..0.00 rows=1 width=2) (actual time=0.001..0.001 rows=0 loops=1)