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
Computers and Technology, 30.08.2019 21:30, isaiahb30
Answers: 2
Computers and Technology, 19.09.2019 22:30, help977
Answers: 1
Computers and Technology, 09.10.2019 03:00, lizredrose5
Answers: 3
Computers and Technology, 02.12.2019 19:31, ramsey5106
Answers: 1
Assume that you have just built a dense b+ tree containing100,000 records, with one record per disk...
Mathematics, 11.06.2020 23:57
Geography, 11.06.2020 23:57
Mathematics, 11.06.2020 23:57
Mathematics, 11.06.2020 23:57
History, 11.06.2020 23:57
Mathematics, 11.06.2020 23:57
Mathematics, 11.06.2020 23:57