| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 269.291 | 431.692 | ↑ 1.0 | 9714 | 1 |
→
Sort (cost=5379.62..5404.10 rows=9793 width=758) (actual time=386.695..431.692 rows=9714 loops=1)
|
| 2. | 51.543 | 162.401 | ↑ 1.0 | 9714 | 1 |
→
Hash Join (cost=2.23..1447.46 rows=9793 width=758) (actual time=0.273..162.401 rows=9714 loops=1)
|
| 3. | 54.544 | 110.804 | ↑ 1.0 | 9714 | 1 |
→
Hash Join (cost=1.16..1311.74 rows=9793 width=748) (actual time=0.149..110.804 rows=9714 loops=1)
|
| 4. | 56.209 | 56.209 | ↑ 1.0 | 9714 | 1 |
→
Seq Scan on packages (cost=0.00..1175.93 rows=9793 width=719) (actual time=0.036..56.209 rows=9714 loops=1) |
| 5. | 0.030 | 0.051 | ↑ 1.0 | 7 | 1 |
→
Hash (cost=1.07..1.07 rows=7 width=29) (actual time=0.051..0.051 rows=7 loops=1)
|
| 6. | 0.021 | 0.021 | ↑ 1.0 | 7 | 1 |
→
Seq Scan on repos (cost=0.00..1.07 rows=7 width=29) (actual time=0.006..0.021 rows=7 loops=1) |
| 7. | 0.038 | 0.054 | ↑ 1.0 | 3 | 1 |
→
Hash (cost=1.03..1.03 rows=3 width=10) (actual time=0.054..0.054 rows=3 loops=1)
|
| 8. | 0.016 | 0.016 | ↑ 1.0 | 3 | 1 |
→
Seq Scan on arches (cost=0.00..1.03 rows=3 width=10) (actual time=0.007..0.016 rows=3 loops=1) |