b+tree.pptVIP

B+-Tree COMP171 Tutorial 9 Deficiency of AVL Tree Performs really bad when the data is too huge and cannot be put in the main memory Too much disk access if the data is stored in the disk Access on disk is much slower than access on main memory No. of disk access is proportional to the depth of AVL tree Alternative Solution — M-ary Tree Every node has multiple children (M-ary means M branches) Depth decreases as branching increases Depth = O(logMn) instead of O(log2n) Therefore, no. of disk access also decreases B+-Tree — Basic Information An M-ary tree (M3) Leaves contain data items all are at the same depth each node has ?L/2? to L data (usually L M in practice) Internal nodes contain searching keys each node has ?M/2? to M children each node has ?(M/2)-1? to (M-1) searching keys key i is the smallest key in subtree i+1 Root can be a single leaf, or has 2 to M children B+-Tree — Example M = L = 4 Records are at the leaves Node are at least half-full, so that the tree will not degenerate into simple binary tree or even link list Left child pointer right child pointer and also left subtree right subtree are defined B+-Tree — In Practical Each internal node leaf has the size of one I/O block of data minimize tree depth and so as no. of disk access First one or two levels of the tree are stored in main memory to speed up searching Most internal nodes have less than (m-1) searching keys most of the time huge space wastage for main memory, but not a big problem for disk B+-Tree — Searching Example 1 Search G B+-Tree — Searching Example 2 Search H B+-Tree — Searching Algorithm Searching KEY: Start from the root If an internal node is reached: Search KEY among the keys in that node linear search or binary search If KEY smallest key, follow the leftmost child pointer down If KEY = largest key, follow the rightmost child pointer down If Ki = KEY Kj, follow the child pointer between Ki and Kj If a leaf is reached: Search KEY among the keys stored in that leaf linear se