explain.depesz.com

PostgreSQL's explain analyze made readable

Result: cApF

Settings
# exclusive inclusive rows x rows loops node
1. 0.075 0.447 ↑ 1.0 2 1

Hash Join (cost=16.91..28.51 rows=2 width=341) (actual time=0.203..0.447 rows=2 loops=1)

  • Hash Cond: ((cp.id)::text = (expense_group.claim_program_id)::text)
2. 0.199 0.199 ↓ 1.0 195 1

Seq Scan on claim_program cp (cost=0.00..10.88 rows=188 width=187) (actual time=0.012..0.199 rows=195 loops=1)

3. 0.007 0.173 ↑ 1.0 2 1

Hash (cost=16.88..16.88 rows=2 width=154) (actual time=0.173..0.173 rows=2 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
4. 0.006 0.166 ↑ 1.0 2 1

Unique (cost=16.85..16.86 rows=2 width=45) (actual time=0.162..0.166 rows=2 loops=1)

5. 0.010 0.160 ↑ 1.0 2 1

Sort (cost=16.85..16.85 rows=2 width=45) (actual time=0.160..0.160 rows=2 loops=1)

  • Sort Key: expense_group.id, expense_group.claim_program_id
  • Sort Method: quicksort Memory: 25kB
6. 0.004 0.150 ↑ 1.0 2 1

Append (cost=0.00..16.84 rows=2 width=45) (actual time=0.008..0.150 rows=2 loops=1)

7. 0.035 0.035 ↑ 1.0 1 1

Seq Scan on expense_group (cost=0.00..7.58 rows=1 width=45) (actual time=0.007..0.035 rows=1 loops=1)

  • Filter: (id = '9003202628163295092'::bigint)
  • Rows Removed by Filter: 125
8. 0.051 0.111 ↑ 1.0 1 1

Hash Join (cost=1.50..9.24 rows=1 width=45) (actual time=0.039..0.111 rows=1 loops=1)

  • Hash Cond: (e.id = ex.group_id)
9. 0.047 0.047 ↑ 1.0 126 1

Seq Scan on expense_group e (cost=0.00..7.26 rows=126 width=45) (actual time=0.002..0.047 rows=126 loops=1)

10. 0.003 0.013 ↑ 1.0 1 1

Hash (cost=1.49..1.49 rows=1 width=16) (actual time=0.013..0.013 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
11. 0.010 0.010 ↑ 1.0 1 1

Seq Scan on eligibility_request_extension ex (cost=0.00..1.49 rows=1 width=16) (actual time=0.005..0.010 rows=1 loops=1)

  • Filter: (id = '2955176187306550544'::bigint)
  • Rows Removed by Filter: 41