# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 |
→
Group (cost=12,652,382.16..12,652,386.29 rows=50 width=1,658) (actual rows= loops=)
|
||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=12,652,382.16..12,652,382.29 rows=50 width=1,610) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=253,047.30..12,652,380.75 rows=50 width=1,610) (actual rows= loops=) |
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=166,976.07..8,348,817.00 rows=50 width=1,601) (actual rows= loops=) |
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=79,613.23..3,980,673.50 rows=50 width=1,585) (actual rows= loops=) |
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on polls p (cost=0.00..10.50 rows=50 width=1,583) (actual rows= loops=) |
||
7. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=79,613.23..79,613.24 rows=1 width=2) (actual rows= loops=) |
||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on polls_users pu (cost=0.00..77,030.02 rows=1,033,281 width=2) (actual rows= loops=)
|
||
9. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=87,362.83..87,362.85 rows=1 width=24) (actual rows= loops=) |
||
10. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on polls_users pu_1 (cost=0.00..77,030.02 rows=1,033,281 width=2) (actual rows= loops=)
|
||
11. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=86,071.23..86,071.24 rows=1 width=8) (actual rows= loops=) |
||
12. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on polls_users pu_2 (cost=0.00..84,779.63 rows=516,640 width=2) (actual rows= loops=)
|