Computers and Technology, 09.10.2019 19:30 maxwellstrauss

Assume that you have just built a dense b+ tree containing100,000 records, with one record per disk sector. the key field is a 20 byte string. pointers (i. e. record ids) are 4 byte values. the size of one disk sector is 1024 bytes. the index was built in a bottom-up fashion using the bulk-loading algorithm and that the nodes at each level were filled up as much as possible. a node corresponds to a disk sector.

a. how many key/pointer pairs fit within a b+ node?
b. how many levels does the resulting tree have?
c. how many leaf nodes are used by the tree?
d. how many total nodes (root, internal, leaf) are required?

Answers: 2

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 22.06.2019 07:30, haleyblu6351

By refraining from constructing a building until they are certain that it will not cause harm to the environment, an organization is adhering to the

Answers: 2

continue

Computers and Technology, 22.06.2019 15:00, vladutraileanu7599

Which of the following has not been attributed at least in part to social media a. drug addiction b. depression c. kidnapping d. murder

Answers: 2

continue

Computers and Technology, 23.06.2019 12:40, melaniem50

Curriculum exam to process a resident's payment, you must click on onesite payments home page. from the a. reports b. my settings o c. transactions o d. rent tab

Answers: 1

continue

Computers and Technology, 23.06.2019 21:30, jayybrain6337

Enzo’s balance sheet for the month of july is shown. enzo’s balance sheet (july 2013) assets liabilities cash $600 credit card $4,000 investments $500 student loan $2,500 house $120,000 mortgage $80,000 car $6,000 car loan $2,000 total $127,100 total $88,500 which expression finds enzo’s net worth?

Answers: 1

continue

You know the right answer?

Assume that you have just built a dense b+ tree containing100,000 records, with one record per disk...