by Jason Lepack <jlepack@[EMAIL PROTECTED]
>
Apr 16, 2008 at 08:21 AM
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...@[EMAIL PROTECTED]
> 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...@[EMAIL PROTECTED]
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.
