Describe how to use a B-tree to implement the Partition ADT (Section 14.7.3) so that the union and find operations each use at most O(logn/logB) disk transfers.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.