| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.127 | 0.237 | ↑ 1.0 | 288 | 1 |
→
Hash Join (cost=5.57..14.41 rows=288 width=143) (actual time=0.101..0.237 rows=288 loops=1)
|
| 2. | 0.025 | 0.025 | ↑ 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.025 rows=288 loops=1) |
| 3. | 0.015 | 0.085 | ↑ 1.0 | 33 | 1 |
→
Hash (cost=5.15..5.15 rows=33 width=143) (actual time=0.085..0.085 rows=33 loops=1)
|
| 4. | 0.012 | 0.070 | ↑ 1.0 | 33 | 1 |
→
Hash Left Join (cost=3.17..5.15 rows=33 width=143) (actual time=0.041..0.070 rows=33 loops=1)
|
| 5. | 0.022 | 0.047 | ↑ 1.0 | 33 | 1 |
→
Hash Right Join (cost=1.74..3.60 rows=33 width=88) (actual time=0.025..0.047 rows=33 loops=1)
|
| 6. | 0.010 | 0.010 | ↑ 1.0 | 32 | 1 |
→
Seq Scan on capability_tr c (cost=0.00..1.41 rows=32 width=59) (actual time=0.004..0.010 rows=32 loops=1)
|
| 7. | 0.007 | 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.008 | 0.008 | ↑ 1.0 | 33 | 1 |
→
Seq Scan on capability (cost=0.00..1.33 rows=33 width=33) (actual time=0.002..0.008 rows=33 loops=1) |
| 9. | 0.003 | 0.011 | ↓ 7.0 | 7 | 1 |
→
Hash (cost=1.41..1.41 rows=1 width=59) (actual time=0.011..0.011 rows=7 loops=1)
|
| 10. | 0.008 | 0.008 | ↓ 7.0 | 7 | 1 |
→
Seq Scan on capability_tr b (cost=0.00..1.41 rows=1 width=59) (actual time=0.006..0.008 rows=7 loops=1)
|