| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=8096.55..41190.96 rows=254422 width=13) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=8094.50..37690.60 rows=254422 width=8) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on reconocimientos r (cost=0.00..18246.26 rows=71621 width=4) (actual time=.. rows= loops=)
|
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3920.22..3920.22 rows=254422 width=8) (actual time=.. rows= loops=) |
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on reconocimientos_protocolos rp (cost=0.00..3920.22 rows=254422 width=8) (actual time=.. rows= loops=) |
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.47..1.47 rows=47 width=13) (actual time=.. rows= loops=) |
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on protocolos p (cost=0.00..1.47 rows=47 width=13) (actual time=.. rows= loops=) |