Answer Posted / aishwarya

Join Stage:
1.) It has n input links(one being primary and remaining
being secondary links), one output link and there is no
reject link
2.) It has 4 join operations: inner join, left outer join,
right outer join and full outer join
3.) join occupies less memory, hence performance is high in
join stage
4.) Here default partitioning technique would be Hash
partitioning technique
5.) Prerequisite condition for join is that before
performing join operation, the data should be sorted.

Look up Stage:
1.) It has n input links, one output link and 1reject link
2.) It can perform only 2 join operations: inner join and
left outer join
3.) Join occupies more memory, hence performance reduces
4.) Here default partitioning technique would be Entire

Merge Stage:
1.) Here we have n inputs master link and update links andn-
1 reject links
2.) in this also we can perform 2 join operations: inner
join, left outer join
3.) the hash partitioning technique is used by default
4.) Memory used is very less, hence performance is high
5.) sorted data in master and update links are mandatory

what is the custome stage in datastage? how can we impliment that one? plz tell me

2410

---

Is it possible to query a hash file?

2062

---

How rejected rows are managed in datastage?

1576

---

Explain the datastage parallel extender (px) or enterprise edition (ee)?

1281

---

What are the repository tables in datastage?

1353

---

Have you have ever worked in unix environment and why it is useful in datastage?

1190

---

Is possible to create skid in dim,fact tables?

2693

---

Differentiate between validated and Compiled in the Datastage?

1357

---

how to add a new records into source?

2058

---

What are orabulk and bcp stages?

1165

---

What are system variables and sequencers in datastage

1183

---

What is the difference between the local container and shared container?

1145

---

Explain Quality stage?

1211

---

What is data partitioning?

1269

---

Define meta stage?

1261

---