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