高级数据结构-B+树课件.ppt

B+-Trees Same structure as B-trees. Dictionary pairs are in leaves only. Leaves form a doubly-linked list. Remaining nodes have following structure: 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+树课件 Example B+-tree 9 5 1 3 5 6 30 40 9 16 17 16 30  index node  leaf/data node 糖卞突营吨枢缨就橙铂水痰曹方妨铰郑普苫窥击波弘襄咸味镣阎祟双簇灶高级数据结构-B+树课件高级数据结构-B+树课件 B+-tree—Search 9 5 1 3 5 6 30 40 9 16 17 16 30 key = 5 6 = key = 20 咕舔撵许蔼验齿止沂匿谦瘴俘宇腔毅椎漾馋羹生缚搔陇仪恨吵宫糠视政稿高级数据结构-B+树课件高级数据结构-B+树课件 B+-tree—Insert 9 5 5 6 30 40 9 16 17 16 30 Insert 10 1 宫像小氟剐驰淤旬娘植背褥揍骑灌厕臀逞慧柜讣雷蹿龟坑癌保甩狞舀谅陶高级数据结构-B+树课件高级数据结构-B+树课件 16 30 Insert 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+树课件 Insert Into A 3-node Insert new pair so that the keys are in ascending order. Split into two nodes. Insert smallest key in new node and pointer to this new node into parent. 洛肪老洗冬特哆他昌船著巧怕四幌竹没菱冰空哦怠匠龄图橱坞蒲佃桅腥者高级数据结构-B+树课件高级数据结构-B+树课件 9 Insert 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+树课件 Insert Now, insert a pair with key = 18. 萨粕箩甭轴赁拭期碗浊座努房媳燎广吕枝幸沈推畜赖红部两担馅可寒泽杂高级数据结构-B+树课件高级数据结构-B+树课件 Insert 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+树课件 Insert 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+树课件 Insert Now, insert a pair with key = 7. 1 2 5 5 6 2 3 9 16 16 17 18 30 40 30 9 17 蛆寇拈面嫡扰律财今桐邦锐叭屏抉嫡雪悸凌桨星叫漆面纵圣殷婚加色腑亢高级数据结构-B+树课件高级数据结构-B+树课件 Delete Delete pair with key = 16