Lookup design best practices

Post questions here relative to DataStage Enterprise/PX Edition for such areas as Parallel job design, Parallel datasets, BuildOps, Wrappers, etc.

Moderators: chulett, rschirm, roy

Post Reply
emma
Premium Member
Premium Member
Posts: 95
Joined: Fri Aug 08, 2003 10:30 am
Location: Montreal

Lookup design best practices

Post by emma »

I've seen many times the Lookup stage designed with Sort on both links, the input and the reference link , that I'm wondering if the best practices changed on this one !
I'm talking about a Normal Lookup with the Input Hash Partitioned on Keys and the Reference Entire Partitioned.
What would be the need of sorting the data in this case ? I heard rumors the Lookup would be faster if the data is sorted !
Any opinion of that ?
Thanks,
Emma
qt_ky
Premium Member
Premium Member
Posts: 2895
Joined: Wed Aug 03, 2011 6:16 am
Location: USA

Post by qt_ky »

There's no sorting requirement for Lookup stage links. I would think sorting unnecessarily would slow the job down.
Choose a job you love, and you will never have to work a day in your life. - Confucius
emma
Premium Member
Premium Member
Posts: 95
Joined: Fri Aug 08, 2003 10:30 am
Location: Montreal

Post by emma »

Thank you qt_ky.
Thanks,
Emma
Post Reply