GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Interview Questions  >  Data Warehousing  >  DataStage

 Print  |  
Question:  Lookup Stage Partitioning

Answer: With a Lookup stage the input stage has 1million records and reference link has 1million records. What is the best Partition method and why?


March 03, 2009 09:00:17 #2
 anujk_arora   Member Since: March 2009    Total Comments: 1 

RE: Lookup Stage Partitioning
 
I believe it depends upon the system configuration as the data in the reference link is loaded into the main Memory while processing. If the total consumption of the memory passing through the reference link is above the total capacity of the machine, in that case we should look for alternatives. It could be hash partitioning on reference link along with the main link. Having said this it all depends upon the logic. So, i believe, nothing is ideal for the lookup stage paritioning although entire is a default technique but should be changed if the situation demands.
     

 

Back To Question