type of join in sql

From: BigP <big_planet_2000_at_hotmail.com>
Date: Tue, 23 Jul 2002 17:58:30 -0800
Message-ID: <F001.004A05B7.20020723175830@fatcity.com>

can some body shed some light on how does the optimizer decides to choose the kind of join i.e. nested loop, sort merge or hash join . In one of queries if i tweak the join condition it changes the type of join and start using index , otherwise it doesn't . I thought it depends on statistics .. if optimize finds that are more qualifying records in inner table then it will prefer to go for sort merge and will do full scan of inner table , but if it thinks there are less records in inner table it will user nested loop . am I correct ?

TIA ,
bp

--

Please see the official ORACLE-L FAQ: http://www.orafaq.com
--

Author: BigP
  INET: big_planet_2000_at_hotmail.com

Fat City Network Services    -- (858) 538-5051  FAX: (858) 538-5051
San Diego, California        -- Public Internet access / Mailing Lists
--------------------------------------------------------------------

To REMOVE yourself from this mailing list, send an E-Mail message to: ListGuru_at_fatcity.com (note EXACT spelling of 'ListGuru') and in the message BODY, include a line containing: UNSUB ORACLE-L (or the name of mailing list you want to be removed from). You may also send the HELP command for other information (like subscribing). Received on Tue Jul 23 2002 - 20:58:30 CDT