explain.depesz.com

PostgreSQL's explain analyze made readable

Result: y4jF : Nest looop

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

Unique (cost=364,958,072.81..364,958,367.86 rows=59,011 width=32) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Sort (cost=364,958,072.81..364,958,220.34 rows=59,011 width=32) (actual rows= loops=)

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

Gather (cost=1,000.00..364,953,396.57 rows=59,011 width=32) (actual rows= loops=)

  • Workers Planned: 1
4. 0.000 0.000 ↓ 0.0

Nested Loop (cost=0.00..364,946,495.47 rows=34,712 width=32) (actual rows= loops=)

  • Join Filter: ((s.b = r.b) AND (s.c = r.c) AND (t.a = r.a))
5. 0.000 0.000 ↓ 0.0

Nested Loop (cost=0.00..221,065,010.47 rows=8,745 width=28) (actual rows= loops=)

  • Join Filter: ((s.c = t.c) AND (u.a = t.a) AND (s.d = t.d))
6. 0.000 0.000 ↓ 0.0

Nested Loop (cost=0.00..71,649,281.47 rows=226,731 width=24) (actual rows= loops=)

  • Join Filter: ((s.b = u.b) AND (s.d = u.d))
7. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on s (cost=0.00..2,258.47 rows=117,647 width=12) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0

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

9. 0.000 0.000 ↓ 0.0

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

10. 0.000 0.000 ↓ 0.0

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