Show the B-Tree Index(m=3) after insert the following input index:                   9, 1, 5, 12, 6, 4, 12, 10, 9, 3, 8, 5, 9, 12.                  Note. Please show each steps, not only the final answer.     (Please upload file to answer the question.)

The student data file(fixed length record) contains the following attributes: Id   : Varchar(5) (5 bytes) Name  : Varchar(20) (20 bytes) Phone :  Varchar(15) (15 bytes) GPA : Double (5 bytes) -all GPAs are null values.  And index file(fixed length record) contains the following attributes: Id   : Varchar(13) (13 bytes) Pointer: Double (2 bytes) There are 30,000 records in this data file. We want to store the data and index files in a hard drive with the block(page) size = 1KB ~ 1,000 B. The number of blocks or pages that need for storing the data file in a hard drive = _______ .  (The answer must be integer) The number of blocks or pages that need for storing the index file in a hard drive = _______ . (The answer must be integer) Given RAID level 6 for storing index files using 12 hard drives, how many blocks for each drive =  _______ . (The answer must be integer) and a data storage space = _______ % usage. (The answer must be integer)  

Given the set of SS-tables in LSM.         And the hash functions H1(v), H2(v) where v is a search key as: H1(Alan) = 8                                        H2(Alan) = 2 H1(Bobby) = 3                                     H2(Bobby) = 7 H1(Cathy) = 0                                      H2(Cathy) = 7 H1(Paul) = 7                                        H2(Paul) = 8 H1(Zack) = 2                                       H2(Zack) = 6 H1(David) = 0                                      H2(David) = 1 H1(Eric) = 2                                         H2(Eric) = 3 H1(Fred) = 1                                        H2(Fred) = 1 H1(Harry) = 3                                      H2(Harry) = 8 H1(Owen) = 2                                      H2(Owen) = 0 What are bloom bitmap filters for B1? (length = 10 bits) B1 0 1 2 3 4 5 6 7 8 9 B1 0 _______   B1 1 _______   B1 2 _______   B1 3 _______   B1 4 _______   B1 5 _______   B1 6 _______ B1 7 _______ B1 8 _______   B1 9 _______ Given the set of SS-tables in LSM.          And the hash functions H1(v), H2(v) where v is a search key as: H1(Alan) = 8                                        H2(Alan) = 2 H1(Bobby) = 3                                     H2(Bobby) = 7 H1(Cathy) = 0                                      H2(Cathy) = 7 H1(Paul) = 7                                        H2(Paul) = 8 H1(Zack) = 2                                       H2(Zack) = 6 H1(David) = 0                                      H2(David) = 1 H1(Eric) = 2                                         H2(Eric) = 3 H1(Fred) = 1                                        H2(Fred) = 1 H1(Harry) = 3                                      H2(Harry) = 8 H1(Owen) = 2                                      H2(Owen) = 0 What are bloom bitmap filters for B2? (length = 10 bits) B2 0 1 2 3 4 5 6 7 8 9 B2 0 _______   B2 1 _______   B2 2 _______   B2 3 _______   B2 4 _______   B2 5 _______   B2 6 _______ B2 7 _______ B2 8 _______   B2 9 _______

Suppose the program has page requires as: H, A, D, H, E, A, H, E, D, B, A, E. Show the buffer’s page allocation using the replacement policy: Second Chance(Clock Algorithm), where the buffer size = 3.  (Please upload file to answer the question.) 

According to the following figure, if we delete index key all 4s, all 7s and insert 5, what is the B-Tree index(m=4) after the deletions? Note. Please show each step, not only the final answer.  (Please upload file to answer the question.)

WAIT!!! Are you about to submit your exam?  Did you submit your scratch work already?  Don’t forget to complete a file upload to submit your scratch work!!

El signo de exclamación se puede utilizar hasta ______ veces máximo.

Las palabras _____ llevan el acento tónico en la antepenúltima sílaba.

La sílaba tónica de pájaro es:

La sílaba tónica de la palabra cultura es: