Link Paritioner Partition algorithm - Hash & Modulus

raju_chvr · Post by **raju_chvr** » Thu Feb 19, 2004 10:51 am

Can some one give me a example how will they work & some scenario's which one to choose.

I don't have access to DS 6/7 yet, but curious to know abt those stages.

Yeah some people might think I am so outdated with DS 5.1, but What I can say and do ... my client is really slow in keeping upto date with the latest releases

thanks

ray.wurlod · Post by **ray.wurlod** » Thu Feb 19, 2004 3:01 pm

Why not ask Ascential for a copy of the 7.x manuals? They contain much that will answer all of these questions. I am sure they would have no problem with this request.
A very short answer is that the Hash algorithm uses a hashing algorithm based on the supplied key value (which can be any data type) to choose which of 1..N partitions to use, while the Modulus algorithm uses a "remainder", after dividing the supplied key value (which must be numeric) by N.

raju_chvr · Post by **raju_chvr** » Thu Feb 19, 2004 3:14 pm

They are on their way..

we have another vendor in btwn Ascential and my client. They are taking hell lot of time to process our request.

Thanks for ur reply though ...