# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=6,202,409,704.02..6,208,154,170.38 rows=3,216,840 width=33) (actual rows= loops=) |
||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=6,202,409,704.02..6,204,324,526.14 rows=765,928,847 width=33) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=102,883,281.18..6,005,613,331.02 rows=765,928,847 width=33) (actual rows= loops=)
|
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=112.80..6,030,091,378.51 rows=355,268,742 width=12) (actual rows= loops=)
|
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=111.96..168.46 rows=372 width=26) (actual rows= loops=)
|
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Only Scan using unique_domain_for_org_2 on organisation_email_domains d (cost=0.28..47.59 rows=1,021 width=22) (actual rows= loops=) |
||
7. | 0.000 | 0.000 | ↓ 0.0 | |||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on organisations o (cost=0.00..83.63 rows=606 width=4) (actual rows= loops=)
|
||
9. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=0.84..193,375.14 rows=1,910,047 width=8) (actual rows= loops=) |
||
10. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.84..176,362.90 rows=1,910,047 width=8) (actual rows= loops=) |
||
11. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Only Scan using hibp_breaches_on_id_occurred on hibp_breaches b (cost=0.28..8.29 rows=1 width=4) (actual rows= loops=)
|
||
12. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Only Scan using hibp_account_breaches_breach_id_account_id_key on hibp_account_breaches ab (cost=0.56..157,254.14 rows=1,910,047 width=16) (actual rows= loops=)
|
||
13. |
SubPlan (for Nested Loop) |
|||||
14. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=8.46..8.47 rows=1 width=11) (actual rows= loops=) |
||
15. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=8.46..8.47 rows=1 width=11) (actual rows= loops=)
|
||
16. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using hibp_exposed_accounts_pkey on hibp_exposed_accounts (cost=0.43..8.45 rows=1 width=11) (actual rows= loops=)
|
||
17. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1,750.63..1,759.59 rows=3,585 width=33) (actual rows= loops=)
|
||
18. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=1,402.83..1,538.98 rows=3,585 width=33) (actual rows= loops=)
|
||
19. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on organisation_users ou (cost=0.00..86.85 rows=3,585 width=8) (actual rows= loops=) |
||
20. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1,372.37..1,372.37 rows=2,437 width=29) (actual rows= loops=) |
||
21. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on users u (cost=0.00..1,372.37 rows=2,437 width=29) (actual rows= loops=) |