高级数据结构2B树.pptVIP

B-Trees Large degree B-trees used to represent very large dictionaries that reside on disk. Smaller degree B-trees used for internal-memory dictionaries to overcome cache-miss penalties. AVL Trees n = 230 = 109 (approx). 30 = height = 43. When the AVL tree resides on a disk, up to 43 disk access are made for a search. This takes up to (approx) 4 seconds. Not acceptable. Red-Black Trees n = 230 = 109 (approx). 30 = height = 60. When the red-black tree resides on a disk, up to 60 disk access are made for a search. This takes up to (approx) 6 seconds. Not acceptable. m-way Search Trees Each node has up to m – 1 pairs and m children. m = 2 = binary search tree. 4-Way Search Tree Maximum # Of Pairs Happens when all internal nodes are m-nodes. Full degree m tree. # of nodes = 1 + m + m2 + m3 + … + mh-1 = (mh – 1)/(m – 1). Each node has m – 1 pairs. So, # of pairs = mh – 1. Capacity Of m-Way Search Tree Definition Of B-Tree Definition assumes external nodes (extended m-way search tree). B-tree of order m. m-way search tree. Not empty = root has at least 2 children. Remaining internal nodes (if any) have at least ceil(m/2) children. External (or failure) nodes on same level. 2-3 And 2-3-4 Trees B-tree of order m. m-way search tree. Not empty = root has at least 2 children. Remaining internal nodes (if any) have at least ceil(m/2) children. External (or failure) nodes on same level. B-Trees Of Order 5 And 2 B-tree of order m. m-way search tree. Not empty = root has at least 2 children. Remaining internal nodes (if any) have at least ceil(m/2) children. External (or failure) nodes on same level. Minimum # Of Pairs n = # of pairs. # of external nodes = n + 1. Height = h = external nodes on level h + 1. Minimum # Of Pairs m = 200. Choice Of m Worst-case search time. (time to fetch a node + time to search node) * height convention： Root of the B-tree is always in main memory. Any nodes that are passed as parameters must already have had a DISK_READ operation perform