explain.depesz.com

PostgreSQL's explain analyze made readable

Result: s1QB : NOT EXISTS

Settings
# exclusive inclusive rows x rows loops node
1. 0.000 2,497.925 ↑ 1.0 8 1

Finalize GroupAggregate (cost=260,755.73..260,757.76 rows=8 width=16) (actual time=2,497.916..2,497.925 rows=8 loops=1)

  • Group Key: smartq_jobs_log.status
2. 78.056 2,516.825 ↓ 1.5 24 1

Gather Merge (cost=260,755.73..260,757.60 rows=16 width=16) (actual time=2,497.909..2,516.825 rows=24 loops=1)

  • Workers Planned: 2
  • Workers Launched: 2
3. 0.060 2,438.769 ↑ 1.0 8 3 / 3

Sort (cost=259,755.71..259,755.73 rows=8 width=16) (actual time=2,438.768..2,438.769 rows=8 loops=3)

  • Sort Key: smartq_jobs_log.status
  • Sort Method: quicksort Memory: 25kB
  • Worker 0: Sort Method: quicksort Memory: 25kB
  • Worker 1: Sort Method: quicksort Memory: 25kB
4. 567.655 2,438.709 ↑ 1.0 8 3 / 3

Partial HashAggregate (cost=259,755.51..259,755.59 rows=8 width=16) (actual time=2,438.706..2,438.709 rows=8 loops=3)

  • Group Key: smartq_jobs_log.status
5. 1,016.951 1,871.054 ↑ 1.2 3,009,033 3 / 3

Parallel Hash Anti Join (cost=908.04..240,980.57 rows=3,754,988 width=16) (actual time=3.575..1,871.054 rows=3,009,033 loops=3)

  • Hash Cond: (smartq_jobs_log.job_id = smartq_jobs.id)
6. 850.881 850.881 ↑ 1.2 3,033,717 3 / 3

Parallel Seq Scan on smartq_jobs_log (cost=0.00..192,526.46 rows=3,792,146 width=16) (actual time=0.062..850.881 rows=3,033,717 loops=3)

7. 1.911 3.222 ↑ 2.0 6,171 3 / 3

Parallel Hash (cost=753.57..753.57 rows=12,358 width=8) (actual time=3.222..3.222 rows=6,171 loops=3)

  • Buckets: 32,768 Batches: 1 Memory Usage: 992kB
8. 1.311 1.311 ↓ 1.5 18,513 1 / 3

Parallel Index Only Scan using idx_sj_user_id_cur_status on smartq_jobs (cost=0.43..753.57 rows=12,358 width=8) (actual time=0.061..3.932 rows=18,513 loops=1)

  • Index Cond: (user_id = 108)
  • Heap Fetches: 0