Question: Exercise 15.4.3: From Database Systems 2nd Edition. Suppose that the second pass of an algorithm described in this section does not need all M buffers,
Exercise 15.4.3: From Database Systems 2nd Edition.
Suppose that the second pass of an algorithm described in this section does not need all M buffers, because there are fewer than M sublists. How might we save disk I/O s by using the extra buffers?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
