Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Mailing Lists -> Oracle-L -> RE: CBO - hash join vs nested loops

RE: CBO - hash join vs nested loops

From: Laimutis Nedzinskas <lnd_at_HNIT.is>
Date: Mon, 5 Dec 2005 15:53:40 -0000
Message-ID: <B201EF146906A446B13E38A111BD83791F5976@HNIT-SEIFUR>


From: oracle-l-bounce_at_freelists.org
[mailto:oracle-l-bounce_at_freelists.org] On Behalf Of Jonathan Lewis
"

The first STRATEGIC step is to get the system statistics set so that the optimizer has a truthful image about the time cost of multiblock reads, and the CPU cost of doing tablescans.
"

Can you elaborate a bit more what can be considered for this truthful image apart from the straightforward "compute all for all cascade all"? The only thing left seems to be the histograms which, yes, opens a lot possibilities.

--
http://www.freelists.org/webpage/oracle-l
Received on Mon Dec 05 2005 - 10:51:37 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US