Estimate the time in milliseconds to insert a new row into the table of Exercise 9.17 when each of the following indices is used:
a. No index (?le sorted on the search key)
b. A static hash index (with no over?ow pages)
c. A clustered, unintegrated B+ tree index (with no node splitting required)
a. Use a binary search to locate the page in which the new row is to be inserted and assume that there is room in the target page. The data ?le occupies 5000 pages and the search will require retrieving log25000 = 13. An additional I/O operation is required to write the page back to mass store, hence 14 I/O operations taking 280ms are required.
b. Assuming once again that the target bucket has room for the new row, 2 I/O operations and 40ms are required.
c. As in Exercise 9.17, 4 I/O operations are required to retrieve the page into which the new row must be inserted. Two additional I/O operations are required to update the leaf page of the index and the data page. Hence, the time to do the insertion is 120ms.
You might also like to view...
What is wrong with the following statement? Provide the correct statement to accomplish what the programmer was probably trying to do.
``` cout << ++( x + y ); ```
Which layer includes the physical transmission medium (cables or wireless media) that any network must use to send and receive the signals that constitute the physical expression of networked communications?
A. Data Link B. Physical C. Network D. Transport
The ________ element defines the start and end of a button
Fill in the blank(s) with correct word
An incremental backup backs up files that have been created or changed since the last incremental backup
Indicate whether the statement is true or false