Calculate the maximum order of the B-tree so that the each node fits into a page. Calculate the height of the B-tree with that order so that all the 50,000,000 records can be accessed. Calculate how many levels of the B-tree can fit into the memory of the computer. Calculate how many disk accesses are necessary to find a specific record using this search structure.
Calculate the maximum number of entries that can fit into one page in extendible hashing. Calculate the maximum size hash table that can fit in main memory. Assuming that the pages in extendible hashing are about 3/4-th full, how many pages are needed to store all the pages, not including the pages needed for the actual data. Given the constraints of the memory available will extendible hashing work for this database? If so, suggest the a suitable hash table size. How many disk accesses per look-up are needed?