Re: Hash Join

From: Jason Lepack <jlepack_at_gmail.com>
Date: Wed, 16 Apr 2008 08:21:04 -0700 (PDT)
Message-ID: <426439f7-559a-4c7d-ba9b-4fa6743af95d_at_l64g2000hse.googlegroups.com>


Sorry, I misunderstood your post. I found the assignment that you're working on (or a similar one), looks interesting. Remember the algorithm for the Hash Join, as can be found by Googling "Hash Join" (and you should have this in your notes).

Cheers,
Jason Lepack

On Apr 16, 11:12 am, Jason Lepack <jlep..._at_gmail.com> wrote:
> Well of course Google comes up with a good first step:http://en.wikipedia.org/wiki/Hash_join
>
> On Apr 15, 7:31 pm, develop.attit..._at_gmail.com wrote:
>
> > Hi
>
> > am doing a project on hash join. implementation to be done on hasNext
> > and getNext interface.
> > hash join has 2 phases. partitioning phase and probing phase.
>
> > but i dont understand where the partition will be done. in hasNext or
> > getNext interface.
> > can anyone please help.
>
> > develop.attitude.
Received on Wed Apr 16 2008 - 17:21:04 CEST

Original text of this message