# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.001 | 87.247 | ↓ 1.4 | 7 | 1 |
→
Limit (cost=12,583.25..12,583.26 rows=5 width=650) (actual time=87.243..87.247 rows=7 loops=1) |
2. | 0.045 | 87.246 | ↓ 1.4 | 7 | 1 |
→
Sort (cost=12,583.25..12,583.26 rows=5 width=650) (actual time=87.243..87.246 rows=7 loops=1)
|
3. | 0.187 | 87.201 | ↓ 1.4 | 7 | 1 |
→
Nested Loop Left Join (cost=3,104.58..12,583.19 rows=5 width=650) (actual time=85.936..87.201 rows=7 loops=1) |
4. | 0.012 | 86.895 | ↓ 1.4 | 7 | 1 |
→
Nested Loop Left Join (cost=3,096.13..12,539.67 rows=5 width=1,299) (actual time=85.821..86.895 rows=7 loops=1) |
5. | 0.010 | 86.834 | ↓ 1.4 | 7 | 1 |
→
Nested Loop (cost=3,095.57..12,496.66 rows=5 width=1,307) (actual time=85.803..86.834 rows=7 loops=1) |
6. | 0.016 | 86.663 | ↓ 1.4 | 7 | 1 |
→
Nested Loop (cost=3,074.58..12,391.52 rows=5 width=1,275) (actual time=85.743..86.663 rows=7 loops=1) |
7. | 0.005 | 86.465 | ↓ 1.4 | 7 | 1 |
→
Nested Loop (cost=3,074.02..12,349.59 rows=5 width=57) (actual time=85.701..86.465 rows=7 loops=1) |
8. | 0.305 | 0.305 | ↑ 1.0 | 1 | 1 |
→
Seq Scan on offering o (cost=0.00..46.95 rows=1 width=20) (actual time=0.207..0.305 rows=1 loops=1)
|
9. | 0.236 | 86.155 | ↓ 1.4 | 7 | 1 |
→
Hash Join (cost=3,074.02..12,302.59 rows=5 width=45) (actual time=85.491..86.155 rows=7 loops=1)
|
10. | 0.533 | 0.533 | ↑ 4.7 | 730 | 1 |
→
Index Scan using op_unique_prod_idx on offering_product op (cost=0.56..9,216.18 rows=3,439 width=45) (actual time=0.019..0.533 rows=730 loops=1)
|
11. | 10.741 | 85.386 | ↑ 1.0 | 10,570 | 1 |
→
Hash (cost=2,941.34..2,941.34 rows=10,570 width=8) (actual time=85.386..85.386 rows=10,570 loops=1)
|
12. | 27.168 | 74.645 | ↑ 1.0 | 10,570 | 1 |
→
HashAggregate (cost=2,835.64..2,941.34 rows=10,570 width=8) (actual time=72.301..74.645 rows=10,570 loops=1)
|
13. | 47.477 | 47.477 | ↑ 1.0 | 29,375 | 1 |
→
Seq Scan on planned_quantities pq (cost=0.00..2,762.20 rows=29,376 width=8) (actual time=0.126..47.477 rows=29,375 loops=1)
|
14. | 0.182 | 0.182 | ↑ 1.0 | 1 | 7 |
→
Index Scan using product_pkey on product p (cost=0.56..8.38 rows=1 width=1,265) (actual time=0.026..0.026 rows=1 loops=7)
|
15. | 0.035 | 0.161 | ↑ 1.0 | 1 | 7 |
→
Aggregate (cost=21.00..21.01 rows=1 width=32) (actual time=0.023..0.023 rows=1 loops=7)
|
16. | 0.056 | 0.126 | ↑ 1.0 | 2 | 7 |
→
Hash Join (cost=8.86..20.98 rows=2 width=516) (actual time=0.015..0.018 rows=2 loops=7)
|
17. | 0.014 | 0.014 | ↑ 28.0 | 5 | 7 |
→
Seq Scan on tag t (cost=0.00..11.40 rows=140 width=520) (actual time=0.001..0.002 rows=5 loops=7) |
18. | 0.014 | 0.056 | ↑ 1.0 | 2 | 7 |
→
Hash (cost=8.84..8.84 rows=2 width=4) (actual time=0.008..0.008 rows=2 loops=7)
|
19. | 0.042 | 0.042 | ↑ 1.0 | 2 | 7 |
→
Index Scan using tags_op_op_fk_idx on tag_offering_product top (cost=0.43..8.84 rows=2 width=4) (actual time=0.005..0.006 rows=2 loops=7)
|
20. | 0.007 | 0.049 | ↓ 0.0 | 0 | 7 |
→
Limit (cost=0.56..8.58 rows=1 width=8) (actual time=0.007..0.007 rows=0 loops=7) |
21. | 0.042 | 0.042 | ↓ 0.0 | 0 | 7 |
→
Index Scan using huy_test_idx on alert (cost=0.56..8.58 rows=1 width=8) (actual time=0.006..0.006 rows=0 loops=7)
|
22. | 0.077 | 0.119 | ↑ 1.0 | 1 | 7 |
→
Aggregate (cost=8.45..8.47 rows=1 width=32) (actual time=0.017..0.017 rows=1 loops=7) |
23. | 0.042 | 0.042 | ↓ 2.0 | 2 | 7 |
→
Index Scan using planned_quantities_pk on planned_quantities pq_1 (cost=0.41..8.43 rows=1 width=8) (actual time=0.005..0.006 rows=2 loops=7)
|