For a highperformance system such as a Btree index for a database, the page size is determined mainly by the data size and disk performance. Assume that on average a Btree index page is 70% full with fixsized entries. The utility of a page is its Btree depth, calculated as log2(entries). The following table shows that for 16byte entries, and a 10yearold disk with a 10 ms latency and 10 MB/s transfer rate, the optimal page size is 16K.
What is the best page size if entries now become 128 bytes?