| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=164.92..164.94 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=137.35..164.92 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=133.01..133.02 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=9.41..133.01 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=9.41..129.19 rows=1 width=16) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..26.37 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on domain_values_category dvc2 (cost=0.00..8.16 rows=1 width=8) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using domain_values_category_fk_key on domain_values dv2 (cost=0.00..18.19 rows=1 width=16) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on transition_folder tfff (cost=9.41..101.41 rows=113 width=24) (actual time=.. rows= loops=)
|
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on idx66 (cost=0.00..9.38 rows=113 width=0) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using path_map_pkey on path_map pm (cost=0.00..3.81 rows=1 width=8) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on transition_folder tff (cost=4.34..31.79 rows=9 width=8) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on idx55 (cost=0.00..4.34 rows=9 width=0) (actual time=.. rows= loops=)
|