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?

answer: 2 min

explanation:

they run fast

solution:

bookmark is a word, symbol, image, or other object that links you to another element in another location.

bookmark is a saved shortcut that directs your browser to a specific webpage. it stores the title, url, and favicon of the corresponding page. saving bookmarks allows you to easily access your favorite locations on the web.

it works in all modern web browsers include bookmark features. bookmarks are called favorites or internet shortcuts in internet explorer, and by virtue of that browser's large market share, these terms have been synonymous with bookmark since the first browser war.