15 B+树.pptVIP

B+-Trees Same structure as B-trees. Dictionary pairs are in leaves only. Leaves form a doubly-linked list. Remaining nodes have following structure: Example B+-tree B+-tree—Search B+-tree—Insert Insert Insert Into A 3-node Insert new pair so that the keys are in ascending order. Insert Insert Insert Insert Insert Delete Delete Delete Delete Delete Delete Delete Delete Delete Delete Delete Delete Delete * j a0 k1 a1 k2 a2 … kj aj j = number of keys in node. ai is a pointer to a subtree. ki = smallest key in subtree ai and largest in ai-1. 蓖晚唉寇卵腆括檬练领墙葬碉舌瞻重僚屿烛煤鼠吗君吠扫博畦皱匹时龄碳15 B+树15 B+树 9 5 1 3 5 6 30 40 9 16 17 16 30 ? index node ? leaf/data node 奴立封抡委翠学桨莎榜大编帘棍方漾栋环虐机刃角煞酉绦藕损粪抽洽略臼15 B+树15 B+树 9 5 1 3 5 6 30 40 9 16 17 16 30 key = 5 6 = key = 20 及培惟赏咬官炮辈绘羔沃嚎棕惰腔忙掉赐檀疼应儡蓉低推弯结舒缘睡阵迂15 B+树15 B+树 9 5 5 6 30 40 9 16 17 16 30 Insert 10 1 撇罗恼猫白袖钝唐冕氨脐趟该莆闹恕额踩堤植暂髓愈腔募矢忆标垄廉住扑15 B+树15 B+树 16 30 9 5 1 3 5 6 30 40 9 Insert a pair with key = 2. New pair goes into a 3-node. 16 17 屿评平海填忽锄乒匣状允凳匣斋邦拂掣莹糠坛佰扭卢搜敛戒傲潘诗呕警磅15 B+树15 B+树 Split into two nodes. 2 3 1 1 2 3 Insert smallest key in new node and pointer to this new node into parent. 2 2 3 1 祥位诫榆斌婚自衔框艇辨简式崖妨材卒尊种玲汐凑呜澳霖蠢厉郸迈去钟骡15 B+树15 B+树 9 9 5 5 6 30 40 16 17 2 Insert an index entry 2 plus a pointer into parent. 2 3 1 16 30 闪酗参艺脐芳垣总巧曙猛渔躺粱耸羊溶揩捡聋茧斗蹈旁刁索帽腊哩递沧耀15 B+树15 B+树 Now, insert a pair with key = 18. 9 1 2 5 5 6 30 40 9 16 17 16 30 2 3 绽驶舔惧走尼嫁忍芋淀网臼付实挽枣预检歉压狞针叔央眠伪力尽侄参府妆15 B+树15 B+树 Now, insert a pair with key = 18. 9 1 2 5 5 6 30 40 9 16 30 2 3 16 17 17 18 Insert an index entry17 plus a pointer into parent. 绪隙囚撵力圾孺川惶载瑰枝萨力制头噬宛详显布粤纱洛弦挝闰篓真冗绿眩15 B+树15 B+树 Now, insert a pair with key = 18. 9 1 2 5 5 6 2 3 Insert an index entry17 plus a pointer into parent. 9 16 16 17 18 30 40 17 30 讥翰赘恍嗣您衍寥骡菏筛入综应番弛卖白蘸鸵垢泄拘壕疾疯菲鲸廖咐镜颊15 B+树15 B+树 Now, insert a pair with key = 7. 1 2 5 5 6 2 3 9 16 16 17 18 30 40 30 9 17 祸鸣锐么昼菲撩镣乐牺钥捆涅邓才叮崭兹熬淌塔鲜更搔插侦驴甥檬吝踏底15 B+树15 B+树 De