# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 |
→
WindowAgg (cost=2,297,866.52..2,297,869.77 rows=186 width=421) (actual rows= loops=) |
||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=2,297,866.52..2,297,866.98 rows=186 width=344) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=2,208,079.39..2,297,859.51 rows=186 width=344) (actual rows= loops=)
|
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=2,208,079.39..2,218,054.39 rows=3,990,000 width=243) (actual rows= loops=)
|
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=2,103.99..379,566.14 rows=3,990,000 width=243) (actual rows= loops=)
|
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=2,084.40..155,109.05 rows=3,990,000 width=233) (actual rows= loops=)
|
||
7. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=1,562.76..144,107.41 rows=3,990,000 width=241) (actual rows= loops=)
|
||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=1,211.91..133,276.52 rows=3,990,000 width=241) (actual rows= loops=)
|
||
9. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=1,177.38..64,591.99 rows=1,860,000 width=210) (actual rows= loops=)
|
||
10. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=634.25..38,473.86 rows=1,860,000 width=218) (actual rows= loops=) |
||
11. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=634.25..1,273.86 rows=18,600 width=201) (actual rows= loops=)
|
||
12. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=0.01..383.86 rows=18,600 width=167) (actual rows= loops=) |
||
13. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on application (cost=0.00..11.86 rows=186 width=199) (actual rows= loops=) |
||
14. | 0.000 | 0.000 | ↓ 0.0 |
→
Function Scan on unnest p (cost=0.01..1.00 rows=100 width=32) (actual rows= loops=) |
||
15. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=547.44..547.44 rows=6,944 width=74) (actual rows= loops=) |
||
16. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on party (cost=0.00..547.44 rows=6,944 width=74) (actual rows= loops=) |
||
17. | 0.000 | 0.000 | ↓ 0.0 |
→
Function Scan on unnest t (cost=0.01..1.00 rows=100 width=32) (actual rows= loops=) |
||
18. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=461.46..461.46 rows=6,533 width=24) (actual rows= loops=) |
||
19. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Right Join (cost=308.99..461.46 rows=6,533 width=24) (actual rows= loops=)
|
||
20. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on ba_unit_spatial_unit tsp (cost=0.00..134.90 rows=6,690 width=32) (actual rows= loops=) |
||
21. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=227.33..227.33 rows=6,533 width=24) (actual rows= loops=) |
||
22. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on ba_unit (cost=0.00..227.33 rows=6,533 width=24) (actual rows= loops=) |
||
23. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=29.55..29.55 rows=399 width=47) (actual rows= loops=) |
||
24. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Right Join (cost=18.98..29.55 rows=399 width=47) (actual rows= loops=)
|
||
25. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on app_service_rrr app_r (cost=0.00..9.82 rows=282 width=28) (actual rows= loops=) |
||
26. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=13.99..13.99 rows=399 width=51) (actual rows= loops=) |
||
27. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on app_service app_s (cost=0.00..13.99 rows=399 width=51) (actual rows= loops=) |
||
28. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=262.60..262.60 rows=7,060 width=16) (actual rows= loops=) |
||
29. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on spatial_unit pars (cost=0.00..262.60 rows=7,060 width=16) (actual rows= loops=) |
||
30. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=432.95..432.95 rows=7,095 width=24) (actual rows= loops=) |
||
31. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on cadastre_object par (cost=0.00..432.95 rows=7,095 width=24) (actual rows= loops=) |
||
32. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=14.26..14.26 rows=426 width=526) (actual rows= loops=) |
||
33. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on source s (cost=0.00..14.26 rows=426 width=526) (actual rows= loops=) |