Hey , Need a Sql Developer to solve question
Budget: ₹600 – ₹1,500 INR
1. Consider the Linear Hash organization below that currently has 10 records and 7 buckets. The split pointer (SP) points to bucket 3. For simplicity only key values of records are shown:
Suppose N=4 and the hash functions that are used with this file are hi(key) = key mod (N * 2j), j=0, 1, 2, ...
Currently j is 0, the file is growing from 4 to 8 buckets, and so we are using h0(key) = key mod 4
h1(key) = key mod 8
The splitting policy for this file is to split a bucket after every 2 insertions. That is, there is a split after every other insertion. Insert these keys (records) in this sequence: 12, 23, 7, 9, 18 and illustrate the file after the insertion of 12, 23, 7, 9, 18 (in the style used above)
2. Consider a b+-tree of order 3 (like the example in Nexus, slides 13-28). Insert the following keys (1 through 16) in sequence as shown
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Display your results in list fashion using the format where nodes appear in sequence by level, and within level, in key sequence (one node per line). Each line has a level number and a node.
3. Consider Figure 3.21 in the text (ERD for an airline). Based on the ERD, list the FDs with respect to Airplane, Airplane_Type, and the relationship Type. Note there are 5 attributes to consider: type_name, max_seats, company, airplane_id, total_no_of_seats.
Suppose N=4 and the hash functions that are used with this file are hi(key) = key mod (N * 2j), j=0, 1, 2, ...
Currently j is 0, the file is growing from 4 to 8 buckets, and so we are using h0(key) = key mod 4
h1(key) = key mod 8
The splitting policy for this file is to split a bucket after every 2 insertions. That is, there is a split after every other insertion. Insert these keys (records) in this sequence: 12, 23, 7, 9, 18 and illustrate the file after the insertion of 12, 23, 7, 9, 18 (in the style used above)
2. Consider a b+-tree of order 3 (like the example in Nexus, slides 13-28). Insert the following keys (1 through 16) in sequence as shown
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Display your results in list fashion using the format where nodes appear in sequence by level, and within level, in key sequence (one node per line). Each line has a level number and a node.
3. Consider Figure 3.21 in the text (ERD for an airline). Based on the ERD, list the FDs with respect to Airplane, Airplane_Type, and the relationship Type. Note there are 5 attributes to consider: type_name, max_seats, company, airplane_id, total_no_of_seats.