| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=3044088.10..3044166.20 rows=31240 width=104) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=3041443.46..3041755.86 rows=31240 width=104) (actual time=.. rows= loops=) |
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=1517714.92..3039803.36 rows=31240 width=104) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan part (cost=1517714.92..1519745.48 rows=15620 width=104) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
WindowAgg (cost=1517714.92..1519120.69 rows=46859 width=94) (actual time=.. rows= loops=) |
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1517714.92..1517832.07 rows=46859 width=94) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=479014.57..1514079.59 rows=46859 width=94) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=474284.42..1508470.83 rows=46859 width=73) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on games (cost=470600.70..1503498.49 rows=93718 width=52) (actual time=.. rows= loops=)
|
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on index_total_increment (cost=0.00..470577.28 rows=16807988 width=0) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2637.29..2637.29 rows=83714 width=25) (actual time=.. rows= loops=) |
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on users u1 (cost=0.00..2637.29 rows=83714 width=25) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2637.29..2637.29 rows=167429 width=25) (actual time=.. rows= loops=) |
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on users u2 (cost=0.00..2637.29 rows=167429 width=25) (actual time=.. rows= loops=) |
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan part (cost=1517714.92..1519745.48 rows=15620 width=104) (actual time=.. rows= loops=)
|
||
| 16. | 0.000 | 0.000 | ↓ 0.0 |
→
WindowAgg (cost=1517714.92..1519120.69 rows=46859 width=94) (actual time=.. rows= loops=) |
||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1517714.92..1517832.07 rows=46859 width=94) (actual time=.. rows= loops=)
|
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=479014.57..1514079.59 rows=46859 width=94) (actual time=.. rows= loops=)
|
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=474284.42..1508470.83 rows=46859 width=73) (actual time=.. rows= loops=)
|
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on games (cost=470600.70..1503498.49 rows=93718 width=52) (actual time=.. rows= loops=)
|
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on index_total_increment (cost=0.00..470577.28 rows=16807988 width=0) (actual time=.. rows= loops=)
|
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2637.29..2637.29 rows=83714 width=25) (actual time=.. rows= loops=) |
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on users u2 (cost=0.00..2637.29 rows=83714 width=25) (actual time=.. rows= loops=)
|
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2637.29..2637.29 rows=167429 width=25) (actual time=.. rows= loops=) |
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on users u1 (cost=0.00..2637.29 rows=167429 width=25) (actual time=.. rows= loops=) |