Best practices for 2 consecutives transforms

Post questions here relative to DataStage Server Edition for such areas as Server job design, DS Basic, Routines, Job Sequences, etc.

Moderators: chulett, rschirm, roy

Post Reply
kjaouhari
Participant
Posts: 325
Joined: Thu Mar 16, 2006 10:22 am

Best practices for 2 consecutives transforms

Post by kjaouhari »

Hi all,

My question is just on the best practices for two consecutives transforms.
Transforms are used to do look up.

What is the best 1 or 2 ?
1. Put a Hash File or Sequential between the two Look up
2. Nothing between the transforms

Thanks !
ashwin141
Participant
Posts: 95
Joined: Wed Aug 24, 2005 2:26 am
Location: London, UK

Best practices for 2 consecutives transforms

Post by ashwin141 »

Hi

I will suggest that you should try avoiding the two transformers. Try implementing all the transformations in one transformer.

If at all you can't avoid then I thing directly linking this transformer to next transformer will be better that using a stage between them and then linking it to second transformer.

I hope that answers your question.

Regards
Ashwin
balajisr
Charter Member
Charter Member
Posts: 785
Joined: Thu Jul 28, 2005 8:58 am

Post by balajisr »

Can you tell exactly what you are trying to do?

As mentioned by ashwin it is better to use only one transfomer rather than two.
kumar_s
Charter Member
Charter Member
Posts: 5245
Joined: Thu Jun 16, 2005 11:00 pm

Post by kumar_s »

Two transformed next to next will be clubbed as a single process during runtime unless interprocess is introduced. And placeing a intermediate passive stage will increase a unecessary IO.
Impossible doesn't mean 'it is not possible' actually means... 'NOBODY HAS DONE IT SO FAR'
loveojha2
Participant
Posts: 362
Joined: Thu May 26, 2005 12:59 am

Post by loveojha2 »

kumar_s wrote:Two transformed next to next will be clubbed as a single process during runtime unless interprocess is introduced. And placeing a intermediate passive stage will increase a unecessary IO.
Kumar, I have one doubt here?
I am aware of the thing that if you put consecutive transformers it would be executed only by a single process, until you have the row buffering enabled.

The doubt is on how is it actually executed?
1. Do all the transformation clubbed together, then it is executed.
2. Or, each single transformer related transformations are executed first, then the row follows the transformations of the succeding transformers in that order.

Thanks
Success consists of getting up just one more time than you fall.
kumar_s
Charter Member
Charter Member
Posts: 5245
Joined: Thu Jun 16, 2005 11:00 pm

Post by kumar_s »

Not only transformer, all active stages are merged to a single process during compilation. Passive stages frame the boundary. All the transformation logic will be built in to a single process. There wont be pipeline parallelism among the stages.
Impossible doesn't mean 'it is not possible' actually means... 'NOBODY HAS DONE IT SO FAR'
kjaouhari
Participant
Posts: 325
Joined: Thu Mar 16, 2006 10:22 am

Post by kjaouhari »

In a first time, the first transformers (look up) is used to get the ColA in FileA
Then in a second time, ColA is used in the second transformers(look up) to get ColB in FileB.

So the process has 2 sequenced steps.

Thanks for your help !
ray.wurlod
Participant
Posts: 54607
Joined: Wed Oct 23, 2002 10:52 pm
Location: Sydney, Australia
Contact:

Re: Best practices for 2 consecutives transforms

Post by ray.wurlod »

kjaouhari wrote:Hi all,

My question is just on the best practices for two consecutives transforms.
Transforms are used to do look up.

What is the best 1 or 2 ?
1. Put a Hash File or Sequential between the two Look up
2. Nothing between the transforms

Thanks !
Nothing between the Transformer stages. If you have multiple CPUs, or the job in its current form consumes less than 40% of the single CPU, enable inter-process row buffering.
IBM Software Services Group
Any contribution to this forum is my own opinion and does not necessarily reflect any position that IBM may hold.
Post Reply