RE: why so much slower

[Toepke, Kevin M]

I'll bet you are running...Oracle...8.1.6. Right?   If so, the solution is   SELECT /*+ NO_MERGE(x) HASH(st) */        * FROM   (your 2 table join) x        ,small_table st WHERE   x.fk = st.pk; -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] Sent: Wednesday, June 05, 2002 4:09 PM To: Multiple recipients of list ORACLE-L Subject: RE: why so much slower Set sort_area_size to very large as 20Gb (obscene) amount of space available. Doing 2 large table outer joins returns results in .341 seconds - both partitioned on same criteria added one small codetable equijoin with one of the larger tables.  There is a foreign key to codetable and index that is unique.   Used hash join hint Used nested loop hint   Basically saw two large joins sort merged hash join then nested join to smaller table - much much smaller codetable.   NO matter what it seems query is much much slower - Any ideas?