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

WindowAgg  (cost=2297866.52..2297869.77 rows=186 width=421)
  ->  Sort  (cost=2297866.52..2297866.98 rows=186 width=344)
        Sort Key: application.application_id
        ->  GroupAggregate  (cost=2208079.39..2297859.51 rows=186 width=344)
              Group Key: application.id
              ->  Sort  (cost=2208079.39..2218054.39 rows=3990000 width=243)
                    Sort Key: application.id
                    ->  Hash Left Join  (cost=2103.99..379566.14 rows=3990000 width=243)
                          Hash Cond: ((application.application_id)::text = (s.application_id)::text)
                          ->  Hash Left Join  (cost=2084.40..155109.05 rows=3990000 width=233)
                                Hash Cond: (pars.id = par.spatial_unit_id)
                                ->  Hash Left Join  (cost=1562.76..144107.41 rows=3990000 width=241)
                                      Hash Cond: (tsp.spatial_unit = pars.id)
                                      ->  Hash Left Join  (cost=1211.91..133276.52 rows=3990000 width=241)
                                            Hash Cond: (application.id = app_s.app_service_id)
                                            ->  Hash Left Join  (cost=1177.38..64591.99 rows=1860000 width=210)
                                                  Hash Cond: (t.title_id = (ba_unit.title_id)::text)
                                                  ->  Nested Loop Left Join  (cost=634.25..38473.86 rows=1860000 width=218)
                                                        ->  Hash Left Join  (cost=634.25..1273.86 rows=18600 width=201)
                                                              Hash Cond: (p.parity_id = (party.party_id)::text)
                                                              ->  Nested Loop Left Join  (cost=0.01..383.86 rows=18600 width=167)
                                                                    ->  Seq Scan on application  (cost=0.00..11.86 rows=186 width=199)
                                                                    ->  Function Scan on unnest p  (cost=0.01..1.00 rows=100 width=32)
                                                              ->  Hash  (cost=547.44..547.44 rows=6944 width=74)
                                                                    ->  Seq Scan on party  (cost=0.00..547.44 rows=6944 width=74)
                                                        ->  Function Scan on unnest t  (cost=0.01..1.00 rows=100 width=32)
                                                  ->  Hash  (cost=461.46..461.46 rows=6533 width=24)
                                                        ->  Hash Right Join  (cost=308.99..461.46 rows=6533 width=24)
                                                              Hash Cond: (tsp.baunit_id = ba_unit.id)
                                                              ->  Seq Scan on ba_unit_spatial_unit tsp  (cost=0.00..134.90 rows=6690 width=32)
                                                              ->  Hash  (cost=227.33..227.33 rows=6533 width=24)
                                                                    ->  Seq Scan on ba_unit  (cost=0.00..227.33 rows=6533 width=24)
                                            ->  Hash  (cost=29.55..29.55 rows=399 width=47)
                                                  ->  Hash Right Join  (cost=18.98..29.55 rows=399 width=47)
                                                        Hash Cond: (app_r.app_service_rrr_id = app_s.id)
                                                        ->  Seq Scan on app_service_rrr app_r  (cost=0.00..9.82 rows=282 width=28)
                                                        ->  Hash  (cost=13.99..13.99 rows=399 width=51)
                                                              ->  Seq Scan on app_service app_s  (cost=0.00..13.99 rows=399 width=51)
                                      ->  Hash  (cost=262.60..262.60 rows=7060 width=16)
                                            ->  Seq Scan on spatial_unit pars  (cost=0.00..262.60 rows=7060 width=16)
                                ->  Hash  (cost=432.95..432.95 rows=7095 width=24)
                                      ->  Seq Scan on cadastre_object par  (cost=0.00..432.95 rows=7095 width=24)
                          ->  Hash  (cost=14.26..14.26 rows=426 width=526)
                                ->  Seq Scan on source s  (cost=0.00..14.26 rows=426 width=526)

Per node type stats

node type	count	sum of times	% of query
Function Scan	2	0.000 ms	0.0 %
GroupAggregate	1	0.000 ms	0.0 %
Hash	8	0.000 ms	0.0 %
Hash Left Join	6	0.000 ms	0.0 %
Hash Right Join	2	0.000 ms	0.0 %
Nested Loop Left Join	2	0.000 ms	0.0 %
Seq Scan	9	0.000 ms	0.0 %
Sort	2	0.000 ms	0.0 %
WindowAgg	1	0.000 ms	0.0 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
app_service	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
app_service_rrr	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
application	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
ba_unit	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
ba_unit_spatial_unit	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
cadastre_object	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
party	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
source	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %
spatial_unit	1	0.000 ms	0.0 %
Seq Scan	1	0.000 ms	0.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: YByu

Color mode:

Visible columns:

Per node type stats

Per table stats