| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Left Join (cost=25296.31..277917.17 rows=610670 width=2309) (actual time=.. rows= loops=)
|
||
| 2. |
Initplan (forMerge Left Join) |
|||||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=12) (actual time=.. rows= loops=)
|
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=25290.08..25304.32 rows=5694 width=2285) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=53.19..13685.91 rows=5694 width=2285) (actual time=.. rows= loops=) |
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=53.19..11969.07 rows=5694 width=805) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=42.15..11155.34 rows=54236 width=451) (actual time=.. rows= loops=)
|
||
| 8. |
Initplan (forHash Join) |
|||||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=12) (actual time=.. rows= loops=)
|
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=1) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on myvars (cost=0.00..6.23 rows=1 width=1) (actual time=.. rows= loops=)
|
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on docin (cost=0.00..9221.39 rows=185951 width=451) (actual time=.. rows= loops=)
|
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=10.89..10.89 rows=10 width=8) (actual time=.. rows= loops=) |
||
| 16. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=6.45..10.89 rows=10 width=8) (actual time=.. rows= loops=)
|
||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on user_gest (cost=4.41..8.68 rows=21 width=4) (actual time=.. rows= loops=)
|
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on idx_usergest_username (cost=0.00..4.41 rows=21 width=0) (actual time=.. rows= loops=)
|
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.81..1.81 rows=18 width=4) (actual time=.. rows= loops=) |
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on mygestiuni (cost=0.00..1.81 rows=18 width=4) (actual time=.. rows= loops=)
|
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=10.77..10.77 rows=21 width=350) (actual time=.. rows= loops=) |
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=6.22..10.77 rows=21 width=350) (actual time=.. rows= loops=)
|
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on user_gest (cost=4.41..8.68 rows=21 width=4) (actual time=.. rows= loops=)
|
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on idx_usergest_username (cost=0.00..4.41 rows=21 width=0) (actual time=.. rows= loops=)
|
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.36..1.36 rows=36 width=346) (actual time=.. rows= loops=) |
||
| 26. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on mygestiuni (cost=0.00..1.36 rows=36 width=346) (actual time=.. rows= loops=) |
||
| 27. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using idxart_idart on articole (cost=0.00..0.29 rows=1 width=1480) (actual time=.. rows= loops=)
|
||
| 28. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=0.00..226694.57 rows=21447 width=28) (actual time=.. rows= loops=) |
||
| 29. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=0.00..226426.48 rows=21447 width=18) (actual time=.. rows= loops=) |
||
| 30. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using idxdocoutlotout on docout (cost=0.00..184937.18 rows=1500903 width=18) (actual time=.. rows= loops=)
|