You are on page 1of 1

1.

Disc access in B-tree insert is O(h) and the total size of table is 34560MB and the chunk

size is 1KB. The total chinks are 35389440/ 1 which equals to 35389440 pages.

2. The B-tree nodes will be increased in every level by 2n and the total height will be found

by the square root of the total number of pages.

sqrt (35389440) = 5948.9

3. Therefore, the approximate cost of the operation will be 5949 after the operation of the

square root.

You might also like