| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=186.25..20573.18 rows=42325 width=178) (actual time=.. rows= loops=) |
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=186.25..20573.18 rows=42325 width=178) (actual time=.. rows= loops=) |
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=186.25..20120.89 rows=42322 width=178) (actual time=.. rows= loops=)
|
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=183.47..19536.17 rows=42322 width=147) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on finarh (cost=0.00..18711.42 rows=43613 width=75) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=157.24..157.24 rows=2098 width=82) (actual time=.. rows= loops=) |
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on konta (cost=0.00..157.24 rows=2098 width=82) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.35..2.35 rows=35 width=36) (actual time=.. rows= loops=) |
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on patnici (cost=0.00..2.35 rows=35 width=36) (actual time=.. rows= loops=) |
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1.58..29.05 rows=3 width=178) (actual time=.. rows= loops=) |
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Right Join (cost=1.58..4.18 rows=3 width=106) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on patnici (cost=0.00..2.35 rows=35 width=36) (actual time=.. rows= loops=) |
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.54..1.54 rows=3 width=75) (actual time=.. rows= loops=) |
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on finarhv (cost=0.00..1.54 rows=3 width=75) (actual time=.. rows= loops=)
|
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using "_dta_index_konta_7_357576312__K1_2_3_14_18" on konta (cost=0.00..8.28 rows=1 width=82) (actual time=.. rows= loops=)
|