Lookup Table vs Hash file

manojkumarnayak · Post by **manojkumarnayak** » Mon Feb 27, 2006 2:37 pm

what are the main differences of using a lookup table or hash file for look up . Which one is more efficient.

manoj

I_Server_Whale · Post by **I_Server_Whale** » Mon Feb 27, 2006 2:51 pm

Hi Manoj,

This topic has been covered several times before. Please use the search facility.

One sample is here

Thanks,
Naveen.

trokosz · Post by **trokosz** » Mon Feb 27, 2006 8:19 pm

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

rasi · Post by **rasi** » Mon Feb 27, 2006 10:44 pm

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

trokosz · Post by **trokosz** » Mon Feb 27, 2006 10:51 pm

I gave my opinion....no more no less.....

I_Server_Whale · Post by **I_Server_Whale** » Tue Feb 28, 2006 4:54 am

Hi rasi,

It is called a hashed file and not a hash file.

Thanks,
Naveen.

ram.m · Post by **ram.m** » Tue Feb 28, 2006 6:37 am

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

DSXchange

Lookup Table vs Hash file

Lookup Table vs Hash file

Re: Lookup Table vs Hash file