Assume we have two relations R(a,b,c) and S(d,e,f), and R issorted on <a,b,c>, and s is sorted
on <d,e,f>. Relation R is stored in 50,000 pages, andrelation S is stored in 10,000 pages. Explain
the algorithm you use to implement the set di erence operation,knowing that you have 100 buffer
pages available. What is the cost of this algorithm?
Expert Answer
An answer will be send to you shortly. . . . .