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 job control?

624

---

Name the different sorting methods in datastage.

617

---

What is the difference between operational data stage (ods) and data warehouse?

679

---

what are .ctl(control files) files ? how the dataset stage have better performance by this files?

2186

---

what is repositery?

1302

---

---

How rejected rows are managed in datastage?

928

---

What are the functionalities of link partitioner?

624

---

Notification Activity

903

---

Can you explain link buffering?

731

---

What is size of a transaction and an array means in a datastage?

744

---

how to use self join using datastage ? can u tell me using stage how can we implemnet the self join

4572

---

What is meta stage?

582

---

Whats difference betweeen operational data stage (ods) and data warehouse?

675

---

What is merge stage?

769

---

How to convert RGB Value to Hexadecimal values in datastage?

3463

---