vijay

• Sep 3rd, 2012

 

Hash

Subhra

• Sep 27th, 2012

 

Partition by Round Robin

Muralidhar

• May 30th, 2013

 

Same partition.
The reason is it keeps the previous partition and send to output as it is.

Mallikarjuna_G

 Profile Answers by Mallikarjuna_G Questions by Mallikarjuna_G

• Aug 10th, 2013

 

It depends on the job design and requrement.

When you specify SAME partitioning, datastage uses the partioing method defined in the previous stage and will not perform any partitioning in the current stage. So, in this case this is the fastest partitioning method.

When you are not bothered about how your data is going to used in the stages down, you can use ROUND ROBIN. As per this this method, input records are distributed among nodes one at a time in a round fashion.

If you are going to perform lookups and sorts on some column/s in the later stages of the design, then identify them in the begining stages and do a HASH partition. Later you can use SAME partition.