Answered step by step
Verified Expert Solution
Question
1 Approved Answer
5 . 1 5 For a high - performance system such as a B - tree index for a database, the page size is determined
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 full with fixsized entries. The utility of a page is its Btree depth, calculated as logentries The following table shows that for byte entries, and a yearold disk with a ms latency and MBs transfer rate, the optimal page size is K
Page Size KB Page Utility or BTree Depth Number of Disk Accesses Saved Index Page Access Cost ms UtilityCost
or logtimes
What is the best page size if entries now become bytes?
Based on what is the best page size if pages are half full?
Based on what is the best page size if using a modern disk with a ms latency and MBs transfer rate? Explain why future servers are likely to have larger pages. Keeping frequently usedor hot pages in DRAM can save disk accesses, but how do we determine the exact meaning of frequently used for a given system? Data engineers use the cost ratio between DRAM and disk access to quantify the reuse time threshold for hot pages. The cost of a disk access is $Diskaccessespersec while the cost to keep a page in DRAM is $DRAMMBpagesize. The typical DRAM and disk costs and typical database page sizes at several time points are listed below:
Year DRAM Cost $MB Page Size KB Disk Cost $disk Disk Access Rate accesssec
What other factors can be changed to keep using the same page size thus avoiding software rewrite Discuss their likeliness with current technology and cost trends.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started