QUERY PLAN ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Nested Loop Left Join (cost=2667862.34..3132471.46 rows=1 width=8) -> Nested Loop Left Join (cost=2667861.90..3132470.72 rows=1 width=16) -> Nested Loop Left Join (cost=2667861.48..3132470.27 rows=1 width=16) -> Nested Loop Left Join (cost=2667861.04..3132469.76 rows=1 width=16) -> Nested Loop Left Join (cost=2667860.61..3132469.29 rows=1 width=16) -> Gather (cost=2667860.17..3132468.79 rows=1 width=24) Workers Planned: 6 -> Hash Semi Join (cost=2666860.17..3131468.69 rows=1 width=24) Hash Cond: (gr.TABLE_E_pk = ar1.TABLE_E_pk) -> Parallel Hash Left Join (cost=2666851.92..3122476.95 rows=3422280 width=32) Hash Cond: (gr.TABLE_D_pk = gm.TABLE_D_pk) -> Parallel Hash Join (cost=2519520.86..2960409.74 rows=3422280 width=32) Hash Cond: (gr.TABLE_A_pk = ii.TABLE_A_pk) -> Parallel Hash Join (cost=1732613.92..2146401.28 rows=3423649 width=40) Hash Cond: (mr.TABLE_O_pk = mi.TABLE_O_pk) -> Parallel Hash Join (cost=1384407.10..1789205.63 rows=3424314 width=48) Hash Cond: (gr.TABLE_E_pk = ar.TABLE_E_pk) -> Parallel Hash Join (cost=850104.36..1245854.83 rows=3446882 width=40) Hash Cond: (ir.TABLE_D_pk = gr.TABLE_D_pk) -> Parallel Hash Join (cost=377639.61..764283.22 rows=3469280 width=24) Hash Cond: (mr.TABLE_G_pk = ir.TABLE_G_pk) -> Parallel Seq Scan on TABLE_G mr (cost=0.00..377476.70 rows=3492155 width=16) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=333991.70..333991.70 rows=3491833 width=16) -> Parallel Seq Scan on TABLE_F ir (cost=0.00..333991.70 rows=3491833 width=16) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=428812.70..428812.70 rows=3492164 width=24) -> Parallel Seq Scan on TABLE_D gr (cost=0.00..428812.70 rows=3492164 width=24) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=490654.70..490654.70 rows=3491843 width=8) -> Parallel Seq Scan on TABLE_E ar (cost=0.00..490654.70 rows=3491843 width=8) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=307982.32..307982.32 rows=3217960 width=8) -> Parallel Seq Scan on TABLE_O mi (cost=0.00..307982.32 rows=3217960 width=8) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=746729.28..746729.28 rows=3214213 width=16) -> Parallel Hash Join (cost=390397.57..746729.28 rows=3214213 width=16) Hash Cond: (ii.TABLE_A_pk = gi.TABLE_A_pk) -> Parallel Seq Scan on TABLE_C ii (cost=0.00..347892.74 rows=3214846 width=8) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=350211.74..350211.74 rows=3214866 width=8) -> Parallel Seq Scan on TABLE_A gi (cost=0.00..350211.74 rows=3214866 width=8) Filter: (is_deleted = 'N'::bpchar) -> Parallel Hash (cost=132675.47..132675.47 rows=1172447 width=8) -> Parallel Seq Scan on TABLE_H gm (cost=0.00..132675.47 rows=1172447 width=8) Filter: (is_deleted = 'N'::bpchar) -> Hash (cost=8.24..8.24 rows=1 width=16) -> Nested Loop (cost=1.00..8.24 rows=1 width=16) -> Index Scan using ix_TABLE_N_type_value_case on TABLE_N aa1 (cost=0.56..4.18 rows=1 width=8) Index Cond: (((TABLE_N_type)::text = 'ID_TYPE_X'::text) AND ((TABLE_N_value)::text = 'SOME/UNIQUE/VALUE'::text)) Filter: (is_deleted = 'N'::bpchar) -> Index Scan using ix_TABLE_E_TABLE_E_pk on TABLE_E ar1 (cost=0.44..4.06 rows=1 width=8) Index Cond: (TABLE_E_pk = aa1.TABLE_E_pk) Filter: ((is_deleted = 'N'::bpchar) AND ((app_case_type)::text = '8'::text)) -> Index Scan using ix_TABLE_I_TABLE_D_pk on TABLE_I gy (cost=0.44..0.49 rows=1 width=8) Index Cond: (TABLE_D_pk = gr.TABLE_D_pk) Filter: (is_deleted = 'N'::bpchar) -> Index Scan using ix_TABLE_J_TABLE_E_pk on TABLE_J ac (cost=0.43..0.46 rows=1 width=8) Index Cond: (TABLE_E_pk = ar.TABLE_E_pk) Filter: (is_deleted = 'N'::bpchar) -> Index Scan using ix_TABLE_N_TABLE_E_pk on TABLE_N aa (cost=0.44..0.49 rows=1 width=8) Index Cond: (TABLE_E_pk = ar.TABLE_E_pk) Filter: (is_deleted = 'N'::bpchar) -> Index Scan using ix_TABLE_L_TABLE_E_pk on TABLE_L ap (cost=0.42..0.44 rows=1 width=8) Index Cond: (TABLE_E_pk = ar.TABLE_E_pk) Filter: (is_deleted = 'N'::bpchar) -> Index Only Scan using ix_TABLE_M_TABLE_G_pk on TABLE_M fp (cost=0.43..0.64 rows=10 width=8) Index Cond: ((TABLE_G_pk = mr.TABLE_G_pk) AND (is_deleted = 'N'::bpchar)) (68 rows)