Relational boolean algebraTwo Pass Query Algorithms - Query Parsing and Optimization

Need an expert who is special in relational sql and boolean algebra [login to view URL] an iterator that uses an algorithm described in class to enumerate the output of the following operations: (a) distinct (b) bag difference. Make sure your iterator reads whole blocks at a time, but outputs tuples at time. [login to view URL] B(R)=B(S)=25,000 and M=2000, what are the disk I/O requirements of: (a) two-pass set intersection from class, (b) sort-join from class.