| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.442 | 3.954 | ↑ 4.0 | 50 | 1 |
→
GroupAggregate (cost=31.23..34.73 rows=200 width=105) (actual time=3.316..3.954 rows=50 loops=1) |
| 2. | 1.979 | 3.512 | ↑ 1.0 | 200 | 1 |
→
Sort (cost=31.23..31.73 rows=200 width=105) (actual time=3.297..3.512 rows=200 loops=1)
|
| 3. | 0.554 | 1.533 | ↑ 1.0 | 200 | 1 |
→
Merge Join (cost=17.64..23.58 rows=200 width=105) (actual time=0.693..1.533 rows=200 loops=1)
|
| 4. | 0.092 | 0.092 | ↑ 19.6 | 51 | 1 |
→
Index Scan using goods_pkey on goods (cost=0.00..56.25 rows=1000 width=105) (actual time=0.016..0.092 rows=51 loops=1) |
| 5. | 0.599 | 0.887 | ↑ 1.0 | 200 | 1 |
→
Sort (cost=17.64..18.14 rows=200 width=8) (actual time=0.666..0.887 rows=200 loops=1)
|
| 6. | 0.288 | 0.288 | ↑ 1.0 | 200 | 1 |
→
Seq Scan on goodsoperations (cost=0.00..10.00 rows=200 width=8) (actual time=0.008..0.288 rows=200 loops=1) |