explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Qqag

Settings

Optimization(s) for this plan:

# exclusive inclusive rows x rows loops node
1. 0.003 1.933 ↓ 4.0 4 1
→

Group (cost=225.88..225.89 rows=1 width=108) (actual time=1.931..1.933 rows=4 loops=1)

  • Group Key: execution.job_execution_id, batch_job_instance.job_name, batch_job_restart_execution.job_next_restart_time
2. 0.020 1.930 ↓ 4.0 4 1
→

Sort (cost=225.88..225.88 rows=1 width=108) (actual time=1.930..1.930 rows=4 loops=1)

  • Sort Key: execution.job_execution_id, batch_job_instance.job_name, batch_job_restart_execution.job_next_restart_time
  • Sort Method: quicksort Memory: 25kB
3. 0.015 1.910 ↓ 4.0 4 1
→

Nested Loop (cost=130.83..225.87 rows=1 width=108) (actual time=1.631..1.910 rows=4 loops=1)

4. 0.037 1.895 ↓ 4.0 4 1
→

Nested Loop (cost=130.55..225.49 rows=1 width=101) (actual time=1.626..1.895 rows=4 loops=1)

  • Join Filter: (batch_job_restart_execution.job_execution_id = execution.job_execution_id)
5. 0.182 1.858 ↑ 18.8 4 1
→

Hash Join (cost=130.27..190.42 rows=75 width=40) (actual time=1.604..1.858 rows=4 loops=1)

  • Hash Cond: (batch_job_execution.job_instance_id = batch_job_restart_execution.job_instance_id)
6. 1.240 1.661 ↓ 1.0 2,515 1
→

HashAggregate (cost=129.14..154.15 rows=2,501 width=16) (actual time=1.343..1.661 rows=2,515 loops=1)

  • Group Key: batch_job_execution.job_instance_id
7. 0.421 0.421 ↑ 1.0 3,409 1
→

Seq Scan on batch_job_execution (cost=0.00..112.09 rows=3,409 width=16) (actual time=0.003..0.421 rows=3,409 loops=1)

8. 0.015 0.015 ↑ 1.5 4 1
→

Hash (cost=1.06..1.06 rows=6 width=24) (actual time=0.015..0.015 rows=4 loops=1)