explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 8Fgd

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

Unique (cost=10,002,805,985.52..10,002,806,001.12 rows=3,120 width=32) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Sort (cost=10,002,805,985.52..10,002,805,993.32 rows=3,120 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=178,221.06..2,805,804.44 rows=3,120 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 Join (cost=609.00..25,144.62 rows=157,662 width=20) (actual rows= loops=)

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

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

6. 0.000 0.000 ↓ 0.0

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

7. 0.000 0.000 ↓ 0.0

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

8. 0.000 0.000 ↓ 0.0

Hash (cost=165,932.06..165,932.06 rows=500,000 width=20) (actual rows= loops=)

9. 0.000 0.000 ↓ 0.0

Gather (cost=5,483.18..165,932.06 rows=500,000 width=20) (actual rows= loops=)

  • Workers Planned: 1
10. 0.000 0.000 ↓ 0.0

Parallel Hash Semi Join (cost=4,483.18..114,932.06 rows=294,118 width=20) (actual rows= loops=)

  • Hash Cond: ((r.b = s.b) AND (r.c = s.c))
11. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on r (cost=0.00..5,644.18 rows=294,118 width=12) (actual rows= loops=)

12. 0.000 0.000 ↓ 0.0

Parallel Hash (cost=2,258.47..2,258.47 rows=117,647 width=8) (actual rows= loops=)

13. 0.000 0.000 ↓ 0.0

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