DSXchange: DataStage and IBM Websphere Data Integration Forum
View next topic
View previous topic
Add To Favorites
Author Message
emma



Group memberships:
Premium Members

Joined: 08 Aug 2003
Posts: 95
Location: Montreal
Points: 590

Post Posted: Fri Jan 12, 2018 11:10 am Reply with quote    Back to top    

DataStage® Release: 11x
Job Type: Parallel
OS: Windows
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



Group memberships:
Premium Members

Joined: 03 Aug 2011
Posts: 2788
Location: USA
Points: 21026

Post Posted: Fri Jan 12, 2018 12:47 pm Reply with quote    Back to top    

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
Rate this response:  
Not yet rated
emma



Group memberships:
Premium Members

Joined: 08 Aug 2003
Posts: 95
Location: Montreal
Points: 590

Post Posted: Wed Jan 17, 2018 8:51 am Reply with quote    Back to top    

Thank you qt_ky.

_________________
Thanks,
Emma
Rate this response:  
Not yet rated
Display posts from previous:       

Add To Favorites
View next topic
View previous topic
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum



Powered by phpBB © 2001, 2002 phpBB Group
Theme & Graphics by Daz :: Portal by Smartor
All times are GMT - 6 Hours