• Extend the sort-merge join algorithm shown in the modified Figure to implement the right outer join operation.

193a.txt Page 1 Modified Figure 19.3 (a) Implementation of the sort-merge join between tables R and S with (R.A S.B) sort the tuples in R on attribute A; // assume R has n tuples (records) sort the tuples in S on attribute B; I/ assume S has m tuples (records) = 1; // initialize the record pointer of table R j # 1; // initialize the record pointer of table S while ((in) && m)) j++i /I advance the record pointer of si elseif (RIi].ASIj].B i+ advance the record pointer of R else 1I RIi].ASI.B, so we output all1 matched pairs of tuples p-ii 1I p is the auxillary record pointer of table R while (p to T; // s the result table q++i p++i ipi // update the primary record pointer of table R j -qi 17 update the primary record pointer of table S