happy cruise lines. consider the happy cruise lines sailor file

Project Description:

consider the happy cruise lines sailor file shown
below. it lists all 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.
sailor file
sailor sailor ship home job
number name number country title
00536 john smith 009 usa purser
00732 ling chang 012 china engineer
06988 maria gonzalez 020 mexico purser
16490 prashant kumar 005 india navigator
18535 alan jones 009 uk cruise
director
20254 jane adams 012 usa captain
23981 rene lopez 020 philippines captain
27467 fred jones 020 uk waiter
27941 alain dumont 009 france captain
28184 susan moore 009 canada wine
steward
31775 james collins 012 usa waiter
32856 sarah mclachlan 012 ireland cabin
steward the happy cruise lines sailor file shown below. it lists all 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.a. create a simple linear index for the sailor file based on:i. the sailor name field.ii. the sailor number field.iii. the ship number field.iv. the combination of the ship number and the job title fields.b. construct a b+-tree index of the type shown in this chapter for the sailor file, assuming now that 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: 02653cylinder 2: 07784cylinder 3: 13957cylinder 4: 18002cylinder 5: 22529cylinder 6: 27486cylinder 7: 35800cylinder 8: 41633cylinder 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.c. the same as part b above, but now there are four index records at the lowest level of the tree index.d. 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.
Skills Required:
Project Stats:

Price Type: Negotiable

Expired
Total Proposals: 2
1 Current viewersl
11 Total views
Project posted by:

Proposals

Proposals Reputation Price offered