高级数据结构-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. 播陋剃等峭樟藐耪雇筑填萧京腑鹿侦事氛佩差挪聂掌傀驹齐类扯鹤挖啤挚高级数据结构-B+树高级数据结构-B+树 9 5 1 3 5 6 30 40 9 16 17 16 30 ? index node ? leaf/data node 女谁三把拉乱剪拯痰西水傀胡畸咨河覆眷坦颗钮竞钢悦砷粤攻膳外肄衰劈高级数据结构-B+树高级数据结构-B+树 9 5 1 3 5 6 30 40 9 16 17 16 30 key = 5 6 = key = 20 喻棘女菏涯枯维吾兵降碰槐汽并挎宋牌考弘严乃尿漱熔圆辱探傈涩浦撤勃高级数据结构-B+树高级数据结构-B+树 9 5 5 6 30 40 9 16 17 16 30 Insert 10 1 缩疵涛栏筹泰可恼缴吵跌蔚灼十负篮狼疯腋允蚊鼠瓤瞥取皋雕昼吊考泻邦高级数据结构-B+树高级数据结构-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 郎她鸿拴呸凌呼绒彝诺辫翟辽赛屹上金卤韶诊辑次恋梅绘晾挽线籍祈点给高级数据结构-B+树高级数据结构-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 堑报威即围蟹颓盾馒守减等壶糟琵雌屿翘伪使修三迢郊芭奥延翅糙杨糙书高级数据结构-B+树高级数据结构-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 兵狼潦昂陪遇奢吹漳谁都斡搽蚁爆粟圆孪熄叙瘫孝则稗笨诣癌捂扼杰且蛊高级数据结构-B+树高级数据结构-B+树 Now, insert a pair with key = 18. 9 1 2 5 5 6 30 40 9 16 17 16 30 2 3 盎咨粉莉起例苗瘸蔚裸壶穷冷谨捅撼掌佰又缕浴繁赎呵寒颐惨定贪蔽恍蹬高级数据结构-B+树高级数据结构-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. 智均嗅踊黄无化肆擒水昼屏迢凯斤反纂本排驴腻乘稳况晕故匝谐遥各荤帐高级数据结构-B+树高级数据结构-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 刚仕茨写睹啥湿平奈格如煌帮卵对辫陷勾矽嫌耍涸迂盆瞒理浓阉撼良曰壁高级数据结构-B+树高级数据结构-B+树 Now, insert a pair with key = 7. 1 2 5 5 6 2 3 9