Course: Datebase II

Master of Computer Science

Please read carefully gou wail find all relevast isdarmatione. Inclnde all cosntial iscas abal mape thut are arcenary so dcrive in molation. Write goar taicht finul fittine. Yoo may nesel to format your filis lanio. pitf Mring your solution to the neat tuturial, so that yoe cat dracinatrate it to your tafoek. - The Aasinumrate have a total of 10 mirks, file every following sosig onet. - Wher uphauling your solutioe in G.ATE, raher nare to have obe of the laced unta Sarmated Writer all of your solution isto a truet file and aleo in lude them is PDF Doxasentafice conn coe soar risulte is Cintat. In wedhe to partiripate in the exam, guu nood to do every aweignenent except. one and grt at leaet half of the point in each asefgument! Furthernore goe beed to present a solution in chass at hast once! Hend this trefore atarting with thw thak alf leal podm in the b+-tron. in your stroctare solution. It inclates, the bodo, loye and EVEPY pointer (cacept date-pointers) The bune dithernor in the drfinitions is sbout the splitting of noden. Theredoen she scoumple below shows, brw the splis are dope for an oven of odM number of loskens in a. For this avedgrnent the definiticns of the Pradiang Databaen Indering a iilf apoly. The poctume below shom, hoe you maler a split for odit and wine number of simontin per fade. Oa the left we can incert ep to 3 elmmente in a rirgle node, mo that we have to rilis the itsrting point in very inyortant snd botaled at the loev oornen of the hertsel? which holde the element! the third, you split them with 2 elennecte th the het node and 1 to thin ryle podel 0 of noorne the iniddle elamest poos ap. Task 1 5 Marks It is December again and Santa Claus prepares for his yearly journey. In the last year hep wanted to store all the people he has to visit with linear hashing, which did not work out as good as he thought. This yoar he will try another attempt on atoring all the names in an index structure again. He thinks, that a B+-tree is perfict for storing the information he needs to save. He already converted the names to numbers and asks you to store all the values in an empty B+-tree. Before he goes to manage his elves he gives you the following information: The B+-tree should have the order of 3 and there are no elements stored so far. He states, that he wants to use the definitions on page 2 of this assignment and urges you to keep in mind, that you will end up on the naughty list, if you forgent to draw just one pointer! (a) Build a B+-tree starting with an empty tree. Insert the following sequence of elements into the tree: 10,13,14,12,11,9,15 Show your tree after each insertion! (b) After you inserted the indexes you recognize Santa rumning towards you. He says that 4 of the indexes are actually wrong and you have to delete them in the following order 9,14,11,12 Show your tree after each deletion! (c) You deleted the indexes and see Sants coming to your office again. He apologizes and states, that the first list was actually correct but he held the paper upside down. You think about it and know what to do: Consider the sequence from (a) and reverse the order! Insert the 'new' sequence into an empty B+-tree starting with 15. Show your trice after the last insertion