subject

Suppose we have a B-Tree that holds keys and leaves. There are 300 million data records (N), and they are stored in the leaves (lowest level) of the B-Tree. Each leaf contains 100 data records. The leaves are stored only at the bottom level of the tree (below the keys), and each key at the bottom level of keys points to one leaf. The B-Tree has 4 levels of keys counting the root level which has m keys. Except for the bottom level, each key has m child keys. The bottom level keys have leaves (one leaf per key). Requried:
a. How many leaves are required to hold all the data records?
b. How many keys are required at the lowest key level of the B-Tree?
c. What is the branching factor (M) of the B-Tree. Show your work.

ansver
Answers: 3

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 10:00
When is an original work considered public domain? a. when posted via social media b. when it is posted on the internet c. when a copyright symbol is not included with the piece of work d. when explicit permission is given by the author / owner
Answers: 1
question
Computers and Technology, 23.06.2019 18:30
Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.
Answers: 3
question
Computers and Technology, 23.06.2019 23:00
How do you know if the website is secure if you make a purchase
Answers: 2
question
Computers and Technology, 24.06.2019 04:30
The ieee 802.11: defines standards for wireless local area network (wlan) communication protocols. identifies various computers or devices connected to a network. verifies any resource attached to another computer on a network that is different from the computer to which the user is logged on. connects multiple local area networks (lans) and wide area networks (wans).
Answers: 2
You know the right answer?
Suppose we have a B-Tree that holds keys and leaves. There are 300 million data records (N), and the...
Questions
question
Mathematics, 12.11.2020 17:50
question
Mathematics, 12.11.2020 17:50
question
Mathematics, 12.11.2020 17:50
question
Mathematics, 12.11.2020 17:50
question
Mathematics, 12.11.2020 17:50
Questions on the website: 13722363