Page 1 of 1
Lookup Table vs Hash file
Posted: Mon Feb 27, 2006 2:37 pm
by manojkumarnayak
what are the main differences of using a lookup table or hash file for look up . Which one is more efficient.
manoj
Posted: Mon Feb 27, 2006 2:51 pm
by I_Server_Whale
Hi Manoj,
This topic has been covered several times before. Please use the
search facility.
One sample is
here
Thanks,
Naveen.
Posted: Mon Feb 27, 2006 8:19 pm
by trokosz
Well a Hash is the file that is used for lookups in a Server Job....Parallel Jobs uses either FileSets or DataSets via a Lookup Stage
Posted: Mon Feb 27, 2006 10:44 pm
by rasi
Hi trokosz
This is a server question and not related to Parallel Jobs. In server job you can have reference links can be a table or a hash file. Thats what manoj is asking which one is more efficient
Posted: Mon Feb 27, 2006 10:51 pm
by trokosz
I gave my opinion....no more no less.....
Posted: Tue Feb 28, 2006 4:54 am
by I_Server_Whale
Hi rasi,
It is called a hashed file and not a hash file.
Thanks,
Naveen.
Re: Lookup Table vs Hash file
Posted: Tue Feb 28, 2006 6:37 am
by ram.m
manojkumarnayak wrote:what are the main differences of using a lookup table or hash file for look up . Which one is more efficient.
manoj
Hi,
Hash file gives good performence than lookup table.
Thanks,
Ram