explain.depesz.com

PostgreSQL's explain analyze made readable

Result: iflo : Optimization for: plan #TGUh

Settings

Optimization path:

# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0

Aggregate (cost=3.45..3.46 rows=1 width=16) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Hash Join (cost=3.24..3.44 rows=2 width=4) (actual rows= loops=)

  • Hash Cond: (claim_application.application_id = ap.application_id)
3. 0.000 0.000 ↓ 0.0

HashAggregate (cost=2.20..2.28 rows=8 width=4) (actual rows= loops=)

  • Group Key: claim_application.application_id
4. 0.000 0.000 ↓ 0.0

Append (cost=0.00..2.18 rows=8 width=4) (actual rows= loops=)

5. 0.000 0.000 ↓ 0.0

Seq Scan on claim_application (cost=0.00..1.09 rows=7 width=4) (actual rows= loops=)

  • Filter: (claim_id = 1,000,361)
6. 0.000 0.000 ↓ 0.0

Seq Scan on claim_ticket_application (cost=0.00..1.01 rows=1 width=4) (actual rows= loops=)

  • Filter: (claim_id = 1,000,361)
7. 0.000 0.000 ↓ 0.0

Hash (cost=1.02..1.02 rows=2 width=8) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0

Seq Scan on application ap (cost=0.00..1.02 rows=2 width=8) (actual rows= loops=)