| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=8141882.12..8142089.69 rows=83028 width=181) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=120017.72..8135098.19 rows=83028 width=181) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on stprice (cost=0.00..203621.42 rows=5608242 width=13) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=118979.87..118979.87 rows=83028 width=172) (actual time=.. rows= loops=) |
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Left Join (cost=112411.09..118979.87 rows=83028 width=172) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=10525.60..10733.13 rows=83014 width=150) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=23.34..3742.91 rows=83014 width=150) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=12.75..14.75 rows=200 width=32) (actual time=.. rows= loops=) |
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Function Scan on fn_stksrch_grep_perl (cost=0.25..10.25 rows=1000 width=32) (actual time=.. rows= loops=) |
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on stock (cost=10.59..18.62 rows=2 width=150) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
BitmapOr (cost=10.59..10.59 rows=2 width=0) (actual time=.. rows= loops=) |
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on stock_idx1 (cost=0.00..5.29 rows=1 width=0) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on stock_idx1 (cost=0.00..5.29 rows=2 width=0) (actual time=.. rows= loops=)
|
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=101778.57..103535.01 rows=702575 width=30) (actual time=.. rows= loops=)
|
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on grpdesc (cost=0.00..33550.49 rows=702575 width=30) (actual time=.. rows= loops=)
|
||
| 16. |
SubPlan (forHash Join) |
|||||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 26. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 27. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 28. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 29. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=13.37..13.38 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 30. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using stock_idx1 on stock a (cost=0.00..13.36 rows=2 width=8) (actual time=.. rows= loops=)
|