| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Limit (cost=17668041.40..17668041.43 rows=12 width=74) (actual time=.. rows= loops=) |
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17668041.40..17668041.90 rows=200 width=74) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=17668033.31..17668036.81 rows=200 width=74) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=124.94..17665164.79 rows=382470 width=74) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on bati b (cost=0.00..576.45 rows=2745 width=36) (actual time=.. rows= loops=) |
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=0.00..88.54 rows=836 width=70) (actual time=.. rows= loops=) |
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pos2006 p (cost=0.00..84.36 rows=836 width=70) (actual time=.. rows= loops=) |
||
| 8. |
SubPlan (forNested Loop Left Join) |
|||||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=124.94..139.80 rows=200 width=32) (actual time=.. rows= loops=) |
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan on a (cost=124.94..138.80 rows=200 width=32) (actual time=.. rows= loops=) |
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=124.94..136.80 rows=200 width=32) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=124.94..127.03 rows=836 width=32) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pos2006 (cost=0.00..84.36 rows=836 width=32) (actual time=.. rows= loops=) |