Course: Database II

DEPARTMENT: Master of computer Science

Technische Universitt Clausthal

Datenbanken II When uploading your solution in GATE, make sure to have one of the |lsted dataformats| Advanced Database Con- ceptsTU Clausthal, Institut fr In- Write all of your solution into a text file and also include them in POF Documen: formatik Due date: 10 lanuary fation along with the result images that you extract from the Neo4, app and up: 2023, 13:00 load in the GATE- System. which you can reach through this linke betpa://ai. in, tu-clanathal, de/. Youcan see your results in Gate. In order to participate in the exam, you need to do every assignment except one and get at least half of the points in each assignment! Furthermore you need to present a solution in class at least oncet Please read carefully Cheating ant copying if yoo have not prepored your solution independently withina team of 2 , for ecample by copying solutions from other students from this In thit assignment we will deal with B thees. To get more information about B or othersemestern, this is considered as cheating and leads to direct exciusion treesyou can recall the lecture Datatase indesine. Moreover in the Reading Database indexine you will find al relevant informations. include all essemial ideas and steps that are neceusary to derive a solution. Write yaur solution in an understanding form or draw the respectively structure with some tool youmight find fitting. You may need to format your files into pdt Bring your solution to the next tutorial, so that you can demonstrate it to your tuton: The Awznments have a total of 10 marks, like every follewing assignment. You can work in teams of up to 21 . State yout partner, when uploading your selulien. Read this before starting with the are included in the drawing. For internat pointers the 1 tarting point ds very int. tasks!l: portant and located at the fower cornies of the rectargle, ahich kolds the ole ment! The usate of the wrone definition leads to aat getting points falso if the steps . The right tree shows how to split for an wwen number of elements in a tree. After are right,you dont get points, when using other definitionsf) Ste the below example in riaht nodel of course the midele element goes up. on how to split leal-nades in the B+, tree. Please read the following. to be sure to do it richt and have every mandatory informationin yaur structure. When you create a B3 tiret, you can make it simple, as you do not need to make extra room inside the hodes for the node-pointers. (But af course you need to draw the pointersil) Moaning a simple structure like in the picture below is sufficient for disolaying your soution. it inctuces, the nedes, kers and EVE aY pointer (except data-peinters)! The banic difference in the definitions is about the spliting of nodes. Therefore the example below shows, how the spliti are done for an even or odd number of indeses in aleaf node. If you find anline.couriet or tutorials, be careful, becaine they might wse other detinitions, which result in other solutions! for this assienment the definition of the Peaiting Database indeaing wilf agply, The picture below shows, how you make a split for odd and even number af elements pernode, On the left we can insert up to 3 elements in a ainde node. to that we have to splitwhen inserting the 4 th. Since we doe't hwe a midet element, we always chose the left one of the 2 in the middle. The resulting tree: is displayed in the picture. Please note, thatalt pointers (except the datapolntern) Task 2 You inspect the new sequence and compare is with the one from task 1(o). Now you are able to answer the following questions for Santa Withour aetually building a B+-tree. (Assume, that the B+tree has the Lame peoper. thes as in task 1). (a) A B-tree has a self-balancing tree structure, so that a differeat seguence. Explain alf your answers? of thesame set may result in a different location for some elements. Santa is not aware of the behaviour and functions of a B4.tree and gives you another list of indenes for a B2-tree. How many elements would be in the leaf nodes affer the int insertion inse a B-tree and how many of the elements would be in the leat fodes of a B-eriee? 12,20,34,18,14,10,36 What is the minimum number of internat noges 10 ifore os set, which has the length of the cien litt? What would the root eiement of the resolting B itree for the aiven se: quenctof elements be? How many leveis would the trualtine B the have? What's the diflerence between 'trees and 8 tree intarking data pointere? (b) Atrer the last oficussion with Santa Claus, he wants to unate Nis onn 8 . tree. He hows you the following eumples of Bl2-treet and wants to know if they are correct. Sate, which of them are valid B++trees and rumect the wrops ones. Drww the respectively vaid tree (with rour corrections) and evplah of necesaary ateot talen, Datenbanken II When uploading your solution in GATE, make sure to have one of the |lsted dataformats| Advanced Database Con- ceptsTU Clausthal, Institut fr In- Write all of your solution into a text file and also include them in POF Documen: formatik Due date: 10 lanuary fation along with the result images that you extract from the Neo4, app and up: 2023, 13:00 load in the GATE- System. which you can reach through this linke betpa://ai. in, tu-clanathal, de/. Youcan see your results in Gate. In order to participate in the exam, you need to do every assignment except one and get at least half of the points in each assignment! Furthermore you need to present a solution in class at least oncet Please read carefully Cheating ant copying if yoo have not prepored your solution independently withina team of 2 , for ecample by copying solutions from other students from this In thit assignment we will deal with B thees. To get more information about B or othersemestern, this is considered as cheating and leads to direct exciusion treesyou can recall the lecture Datatase indesine. Moreover in the Reading Database indexine you will find al relevant informations. include all essemial ideas and steps that are neceusary to derive a solution. Write yaur solution in an understanding form or draw the respectively structure with some tool youmight find fitting. You may need to format your files into pdt Bring your solution to the next tutorial, so that you can demonstrate it to your tuton: The Awznments have a total of 10 marks, like every follewing assignment. You can work in teams of up to 21 . State yout partner, when uploading your selulien. Read this before starting with the are included in the drawing. For internat pointers the 1 tarting point ds very int. tasks!l: portant and located at the fower cornies of the rectargle, ahich kolds the ole ment! The usate of the wrone definition leads to aat getting points falso if the steps . The right tree shows how to split for an wwen number of elements in a tree. After are right,you dont get points, when using other definitionsf) Ste the below example in riaht nodel of course the midele element goes up. on how to split leal-nades in the B+, tree. Please read the following. to be sure to do it richt and have every mandatory informationin yaur structure. When you create a B3 tiret, you can make it simple, as you do not need to make extra room inside the hodes for the node-pointers. (But af course you need to draw the pointersil) Moaning a simple structure like in the picture below is sufficient for disolaying your soution. it inctuces, the nedes, kers and EVE aY pointer (except data-peinters)! The banic difference in the definitions is about the spliting of nodes. Therefore the example below shows, how the spliti are done for an even or odd number of indeses in aleaf node. If you find anline.couriet or tutorials, be careful, becaine they might wse other detinitions, which result in other solutions! for this assienment the definition of the Peaiting Database indeaing wilf agply, The picture below shows, how you make a split for odd and even number af elements pernode, On the left we can insert up to 3 elements in a ainde node. to that we have to splitwhen inserting the 4 th. Since we doe't hwe a midet element, we always chose the left one of the 2 in the middle. The resulting tree: is displayed in the picture. Please note, thatalt pointers (except the datapolntern) Task 2 You inspect the new sequence and compare is with the one from task 1(o). Now you are able to answer the following questions for Santa Withour aetually building a B+-tree. (Assume, that the B+tree has the Lame peoper. thes as in task 1). (a) A B-tree has a self-balancing tree structure, so that a differeat seguence. Explain alf your answers? of thesame set may result in a different location for some elements. Santa is not aware of the behaviour and functions of a B4.tree and gives you another list of indenes for a B2-tree. How many elements would be in the leaf nodes affer the int insertion inse a B-tree and how many of the elements would be in the leat fodes of a B-eriee? 12,20,34,18,14,10,36 What is the minimum number of internat noges 10 ifore os set, which has the length of the cien litt? What would the root eiement of the resolting B itree for the aiven se: quenctof elements be? How many leveis would the trualtine B the have? What's the diflerence between 'trees and 8 tree intarking data pointere? (b) Atrer the last oficussion with Santa Claus, he wants to unate Nis onn 8 . tree. He hows you the following eumples of Bl2-treet and wants to know if they are correct. Sate, which of them are valid B++trees and rumect the wrops ones. Drww the respectively vaid tree (with rour corrections) and evplah of necesaary ateot talen