| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.120 | 0.231 | ↑ 1.0 | 288 | 1 |
→
Hash Join (cost=5.89..14.73 rows=288 width=143) (actual time=0.099..0.231 rows=288 loops=1)
|
| 2. | 0.027 | 0.027 | ↑ 1.0 | 288 | 1 |
→
Seq Scan on service_offer_capability soc (cost=0.00..4.88 rows=288 width=4) (actual time=0.007..0.027 rows=288 loops=1) |
| 3. | 0.016 | 0.084 | ↑ 1.0 | 33 | 1 |
→
Hash (cost=5.48..5.48 rows=33 width=143) (actual time=0.084..0.084 rows=33 loops=1)
|
| 4. | 0.014 | 0.068 | ↑ 1.0 | 33 | 1 |
→
Hash Left Join (cost=3.32..5.48 rows=33 width=143) (actual time=0.040..0.068 rows=33 loops=1)
|
| 5. | 0.019 | 0.044 | ↑ 1.0 | 33 | 1 |
→
Hash Right Join (cost=1.74..3.67 rows=33 width=88) (actual time=0.025..0.044 rows=33 loops=1)
|
| 6. | 0.010 | 0.010 | ↑ 1.0 | 32 | 1 |
→
Seq Scan on capability_tr c (cost=0.00..1.49 rows=32 width=59) (actual time=0.003..0.010 rows=32 loops=1)
|
| 7. | 0.009 | 0.015 | ↑ 1.0 | 33 | 1 |
→
Hash (cost=1.33..1.33 rows=33 width=33) (actual time=0.015..0.015 rows=33 loops=1)
|
| 8. | 0.006 | 0.006 | ↑ 1.0 | 33 | 1 |
→
Seq Scan on capability (cost=0.00..1.33 rows=33 width=33) (actual time=0.002..0.006 rows=33 loops=1) |
| 9. | 0.002 | 0.010 | ↑ 1.0 | 7 | 1 |
→
Hash (cost=1.49..1.49 rows=7 width=59) (actual time=0.010..0.010 rows=7 loops=1)
|
| 10. | 0.008 | 0.008 | ↑ 1.0 | 7 | 1 |
→
Seq Scan on capability_tr b (cost=0.00..1.49 rows=7 width=59) (actual time=0.006..0.008 rows=7 loops=1)
|