| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 5.382 | 420.815 | ↑ 1.0 | 10,000 | 1 |
→
Nested Loop (cost=393.250..27,802.410 rows=10,000 width=762) (actual time=51.168..420.815 rows=10,000 loops=1) |
| 2. | 12.421 | 55.433 | ↑ 1.0 | 10,000 | 1 |
→
HashAggregate (cost=392.690..492.690 rows=10,000 width=60) (actual time=50.951..55.433 rows=10,000 loops=1)
|
| 3. | 1.416 | 43.012 | ↑ 1.0 | 10,000 | 1 |
→
Limit (cost=0.000..267.690 rows=10,000 width=60) (actual time=11.158..43.012 rows=10,000 loops=1) |
| 4. | 41.596 | 41.596 | ↑ 1,003.6 | 10,000 | 1 |
→
Seq Scan on seven (cost=0.000..268,655.220 rows=10,035,922 width=60) (actual time=11.155..41.596 rows=10,000 loops=1) |
| 5. | 360.000 | 360.000 | ↑ 1.0 | 1 | 10,000 |
→
Index Scan using uniform on two (cost=0.560..2.730 rows=1 width=762) (actual time=0.036..0.036 rows=1 loops=10,000)
|