# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 |
→
Limit (cost=150,901.57..150,901.67 rows=40 width=533) (actual rows= loops=) |
||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=150,901.57..150,989.26 rows=35,075 width=533) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan on p (cost=148,565.24..149,792.86 rows=35,075 width=533) (actual rows= loops=)
|
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=148,565.24..148,740.61 rows=35,075 width=561) (actual rows= loops=) |
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=148,565.24..148,652.93 rows=35,075 width=561) (actual rows= loops=)
|
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=137,670.71..140,213.65 rows=35,075 width=561) (actual rows= loops=)
|
||
7. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=137,670.71..137,758.40 rows=35,075 width=570) (actual rows= loops=)
|
||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=35.46..129,242.62 rows=35,075 width=570) (actual rows= loops=)
|
||
9. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=1.67..128,814.15 rows=35,075 width=529) (actual rows= loops=) |
||
10. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Anti Join (cost=1.67..127,316.26 rows=351 width=546) (actual rows= loops=) |
||
11. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=1.11..126,054.90 rows=351 width=546) (actual rows= loops=) |
||
12. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using persons_org_valid_range_gist on persons p_1 (cost=0.55..124,793.06 rows=351 width=485) (actual rows= loops=)
|
||
13. |
SubPlan (for Index Scan) |
|||||
14. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.56..3.58 rows=1 width=0) (actual rows= loops=)
|
||
15. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using person_roles_org_seq_vrange_uidx on person_roles person_roles_1 (cost=0.56..3.58 rows=1 width=0) (actual rows= loops=)
|
||
16. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=6.07..197.77 rows=1 width=0) (actual rows= loops=)
|
||
17. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=6.07..193.25 rows=1 width=49) (actual rows= loops=) |
||
18. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=5.50..189.65 rows=1 width=16) (actual rows= loops=) |
||
19. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using person_roles_org_seq_vrange_uidx on person_roles spr (cost=0.56..3.58 rows=1 width=33) (actual rows= loops=)
|
||
20. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=4.94..186.06 rows=1 width=16) (actual rows= loops=)
|
||
21. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using role_on_role_organization_uuid_idx on role_on_role rr (cost=0.42..181.35 rows=47 width=32) (actual rows= loops=)
|
||
22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3.27..3.27 rows=100 width=16) (actual rows= loops=) |
||
23. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..2.27 rows=100 width=16) (actual rows= loops=) |
||
24. | 0.000 | 0.000 | ↓ 0.0 |
→
ProjectSet (cost=0.00..0.52 rows=100 width=32) (actual rows= loops=) |
||
25. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..0.01 rows=1 width=0) (actual rows= loops=) |
||
26. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using person_roles_org_seq_vrange_uidx on person_roles tpr (cost=0.56..3.58 rows=1 width=33) (actual rows= loops=)
|
||
27. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..2.27 rows=100 width=16) (actual rows= loops=) |
||
28. | 0.000 | 0.000 | ↓ 0.0 |
→
ProjectSet (cost=0.00..0.52 rows=100 width=32) (actual rows= loops=) |
||
29. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..0.01 rows=1 width=0) (actual rows= loops=) |
||
30. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using person_roles_org_seq_vrange_uidx on person_roles pr (cost=0.56..3.58 rows=1 width=77) (actual rows= loops=)
|
||
31. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using person_roles_org_seq_vrange_uidx on person_roles (cost=0.56..3.58 rows=1 width=16) (actual rows= loops=)
|
||
32. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..2.27 rows=100 width=16) (actual rows= loops=) |
||
33. | 0.000 | 0.000 | ↓ 0.0 |
→
ProjectSet (cost=0.00..0.52 rows=100 width=32) (actual rows= loops=) |
||
34. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=0.00..0.01 rows=1 width=0) (actual rows= loops=) |
||
35. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=33.70..33.70 rows=7 width=57) (actual rows= loops=) |
||
36. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on roles role (cost=1.96..33.70 rows=7 width=57) (actual rows= loops=)
|
||
37. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on roles_organization_uuid_idx (cost=0.00..1.96 rows=22 width=0) (actual rows= loops=)
|