Re: Hash join VS sort-merge, nested loops...

From: <eshevtsov_at_my-deja.com>
Date: 2000/07/31
Message-ID: <8m4mi4$e5k$1@nnrp1.deja.com>#1/1

In article <8m47f4$dj7$1_at_news.sinet.slb.com>, "Yong" <yhuang_at_indigopool.com> wrote:
> I agree. Here's what Harrison says on page 161:
>
> and [a hash join] should outperform sort merge joins for large tables
when
> one table is much larger than the other
> ...
> The hash join requires no sorting...
>

Do you want to say that a process of the hash table building (I mean the smallest of two rows set) doesn't require sorting? Is it true?

Edward

Sent via Deja.com http://www.deja.com/
Before you buy. Received on Mon Jul 31 2000 - 00:00:00 CDT