| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.002 | 0.117 | ↑ 20.0 | 1 | 1 |
→
Limit (cost=3262.57..3262.77 rows=20 width=5) (actual time=0.116..0.117 rows=1 loops=1) |
| 2. | 0.020 | 0.115 | ↑ 884.0 | 1 | 1 |
→
HashAggregate (cost=3262.57..3271.41 rows=884 width=5) (actual time=0.115..0.115 rows=1 loops=1) |
| 3. | 0.022 | 0.095 | ↑ 16.7 | 53 | 1 |
→
Nested Loop (cost=36.04..3260.36 rows=884 width=5) (actual time=0.036..0.095 rows=53 loops=1) |
| 4. | 0.012 | 0.012 | ↑ 1.0 | 1 | 1 |
→
Index Scan using product_parent_name_idx on product_parent par_ (cost=0.00..16.31 rows=1 width=4) (actual time=0.011..0.012 rows=1 loops=1)
|
| 5. | 0.047 | 0.061 | ↑ 17.0 | 53 | 1 |
→
Bitmap Heap Scan on product p_ (cost=36.04..3232.82 rows=899 width=9) (actual time=0.021..0.061 rows=53 loops=1)
|
| 6. | 0.014 | 0.014 | ↑ 17.0 | 53 | 1 |
→
Bitmap Index Scan on product_parent_id_idx (cost=0.00..35.81 rows=899 width=0) (actual time=0.014..0.014 rows=53 loops=1)
|