B+-Tree,COMP171Tutorial9,DeficiencyofAVLTree,PerformsreallybadwhenthedataistoohugeandcannotbeputinthemainmemoryToomuchdiskaccessifthedataisstoredinthediskAccessondiskismuchslowerthanaccessonmainmemoryNo.ofdiskaccessisproportionaltothedepthofAVLtree,AlternativeSolutionM-aryTree,Everynodehasmultiplechildren(M-arymeansMbranches)DepthdecreasesasbranchingincreasesDepth=O(logMn)insteadofO(log2n)Therefore,no.ofdiskaccessalsodecreases,B+-TreeBasicInformation,AnM-arytree(M3)Leavescontaindataitemsallar
