Answer Posted / chakravarthy kanishka

Look doesnt requires common key coloumn, then why we need key,
if we go for sequential file as a look up, and squential file have huge data,then it hits the performance,again you need to apply the performance techniques to the sequential file while reading the data,so better to avoid sequential file as a reference to look up.

its my guess...
please let me know if wrong.

thanks
kanishka

Which algorithm you used for your hashfile?

1233

---

Enlist various types of routines in datastage.

1328

---

What are the different type of jobs in datastage?

1082

---

how to connect source to db?generally what r stages u used? how to find the data is having delimiter format?

2414

---

What are the various kinds of containers available in datastage?

1100

---

What are routines in datastage? Enlist various types of routines.

1154

---

What are the partitioning techniques available in link partitioner?

2329

---

What are the different kinds of views available in a datastage director?

1075

---

How rejected rows are managed in datastage?

1575

---

What are stage variables, derivations and constants?

1282

---

What are the types of views in datastage director?

1826

---

hi.... am facing typical problem in every interview " I need some critical scenarios faced in real time" plz help me guys

2929

---

Can we use target hash file as a lookup ?

3373

---

What are the functionalities of link partitioner?

1067

---

I/p : F1 table have A,B,C,D,E and F2 table having C,E,V i need output 0utput1: ABD output2: V any one suggest me this

1060

---