explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 3h7J

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

Unique (cost=10,004,037,269.55..10,004,038,057.86 rows=102,000 width=32) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Sort (cost=10,004,037,269.55..10,004,037,663.71 rows=157,662 width=32) (actual rows= loops=)

  • Sort Key: (ROW(u.a, u.b, t.c, u.d))
3. 0.000 0.000 ↓ 0.0

Hash Semi Join (cost=27,063.00..4,019,885.21 rows=157,662 width=32) (actual rows= loops=)

  • Hash Cond: ((u.a = r.a) AND (u.b = r.b) AND (t.c = r.c))
4. 0.000 0.000 ↓ 0.0

Hash Semi Join (cost=8,168.00..1,398,122.46 rows=157,662 width=28) (actual rows= loops=)

  • Hash Cond: ((u.d = s.d) AND (u.b = s.b) AND (t.c = s.c))
5. 0.000 0.000 ↓ 0.0

Hash Join (cost=609.00..25,144.62 rows=157,662 width=24) (actual rows= loops=)

  • Hash Cond: ((u.a = t.a) AND (u.d = t.d))
6. 0.000 0.000 ↓ 0.0

Seq Scan on u (cost=0.00..309.00 rows=20,000 width=12) (actual rows= loops=)

7. 0.000 0.000 ↓ 0.0

Hash (cost=309.00..309.00 rows=20,000 width=12) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0

Seq Scan on t (cost=0.00..309.00 rows=20,000 width=12) (actual rows= loops=)

9. 0.000 0.000 ↓ 0.0

Hash (cost=3,082.00..3,082.00 rows=200,000 width=12) (actual rows= loops=)

10. 0.000 0.000 ↓ 0.0

Seq Scan on s (cost=0.00..3,082.00 rows=200,000 width=12) (actual rows= loops=)

11. 0.000 0.000 ↓ 0.0

Hash (cost=7,703.00..7,703.00 rows=500,000 width=12) (actual rows= loops=)

12. 0.000 0.000 ↓ 0.0

Seq Scan on r (cost=0.00..7,703.00 rows=500,000 width=12) (actual rows= loops=)