Consider the Happy Cruise Lines Sailor file shown below. It lists all of the sai
ID: 2905966 • Letter: C
Question
Consider the Happy Cruise Lines Sailor file shown below. It lists all of the sailors on the company’s cruise ships by their unique sailor identification number, their name, the unique identification number of the ship they currently work on, their home country, and their job title.
1) Create a simple linear index for the Sailor file based on:
a. The Sailor Name field.
b. The Sailor Number field.
c. The Ship Number field.
d. The combination of the Ship Number and the Job Title fields.
2) Construct a B+-tree index of the type shown in this chapter for the Sailor file, assuming that now there are many more records than are shown above. The file and the index have the following characteristics:
The file is stored on nine cylinders of the disk. The highest key values on the nine cylinders, in order, are:
Cylinder 1: 02653
Cylinder 2: 07784
Cylinder 3: 13957
Cylinder 4: 18002
Cylinder 5: 22529
Cylinder 6: 27486
Cylinder 7: 35800
Cylinder 8: 41633
Cylinder 9: 48374
Each index record can hold four key value/pointer pairs.
There are three index records at the lowest level of the tree index.
3) The same as part b above, but now there are four index records at the lowest level of the tree index.
4). The same as part b above, but each index record can hold two key value/pointer pairs and there are five index records at the lowest level of the tree index.
Explanation / Answer
The result is a direct consequence of linear indexing.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.