# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 | |||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=106.14..108.14 rows=200 width=48) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan on t (cost=67.15..97.26 rows=444 width=72) (actual rows= loops=)
|
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
WindowAgg (cost=67.15..87.22 rows=446 width=80) (actual rows= loops=) |
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=67.15..68.27 rows=446 width=64) (actual rows= loops=)
|
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
WindowAgg (cost=36.38..47.53 rows=446 width=64) (actual rows= loops=) |
||
7. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=36.38..37.49 rows=446 width=56) (actual rows= loops=)
|
||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on direct_deposit (cost=0.00..16.75 rows=446 width=56) (actual rows= loops=)
|