I am sending herewith the execution plan for the current issue.
Can you please suggest me further?
Thanks
Code:COUNT(*) ---------- 13892 Execution Plan ---------------------------------------------------------- 0 SELECT STATEMENT Optimizer=CHOOSE (Cost=18936 Card=1 Bytes=39) 1 0 SORT (AGGREGATE) 2 1 CONCATENATION 3 2 HASH JOIN (Cost=10834 Card=3792 Bytes=147888) 4 3 NESTED LOOPS (Cost=10822 Card=3787 Bytes=128758) 5 4 TABLE ACCESS (BY INDEX ROWID) OF 'H35' (Cost=3248 Card=3787 Bytes=75740) 6 5 INDEX (RANGE SCAN) OF 'STF_CANT' (NON-UNIQUE) (Cost=48 Card=3787) 7 4 TABLE ACCESS (BY INDEX ROWID) OF 'T35' (Cost=2 Card=1518461 Bytes=21258454) 8 7 INDEX (UNIQUE SCAN) OF 'IT35' (UNIQUE) (Cost=1 Card=1518461) 9 3 INDEX (FAST FULL SCAN) OF 'TFC_CID' (NON-UNIQUE) (Cost=8 Card=11019 Bytes=55095) 10 2 HASH JOIN (Cost=10834 Card=3792 Bytes=147888) 11 10 NESTED LOOPS (Cost=10822 Card=3787 Bytes=128758) 12 11 TABLE ACCESS (BY INDEX ROWID) OF 'H35' (Cost=3248 Card=3787 Bytes=75740) 13 12 INDEX (RANGE SCAN) OF 'STF_CLOT' (NON-UNIQUE) (Cost=48 Card=3787) 14 11 TABLE ACCESS (BY INDEX ROWID) OF 'T35' (Cost=2 Card=1518461 Bytes=21258454) 15 14 INDEX (UNIQUE SCAN) OF 'IT35' (UNIQUE) (Cost=1 Card=1518461) 16 10 INDEX (FAST FULL SCAN) OF 'TFC_CID' (NON-UNIQUE) (Cost=8 Card=11019 Bytes=55095)




Reply With Quote