B+树资料.pptVIP

Advanced Data StructuresNTUA Spring 2007B+-trees and External memory Hashing Model of Computation Data stored on disk(s) Minimum transfer unit: a page(or block) = b bytes or B records N records - N/B = n pages I/O complexity: in number of pages I/O complexity An ideal index has space O(N/B), update overhead O(1) or O(logB(N/B)) and search complexity O(a/B) or O(logB(N/B) + a/B) where a is the number of records in the answer But, sometimes CPU performance is also important… minimize cache misses - don’t waste CPU cycles B+-tree/wiki/B-tree Records must be ordered over an attribute, SSN, Name, etc. Queries: exact match and range queries over the indexed attribute: “find the name of the student with ID=087-34-7892” or “find all students with gpa between 3.00 and 3.5” B+-tree:properties Insert/delete at log F (N/B) cost; keep tree height-balanced. (F = fanout) Minimum 50% occupancy (except for root). Each node contains d = m = 2d entries. Two types of nodes: index (non-leaf) nodes and (leaf) data nodes; each node is stored in 1 page (disk based method) [BM72] Rudolf Bayer and McCreight, E. M. Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1, 173-189, 1972 Example Root Index node to keys to keys to keys to keys 57 57￡ k81 81￡k95 95￡ Data node From non-leaf node to next leaf in sequence B+tree rules tree of order n (1) All leaves at same lowest level (balanced tree) (2) Pointers in leaves point to records except for “sequence pointer” (3) Number of pointers/keys for B+tree Insert into B+tree (a) simple case space available in leaf (b) leaf overflow (c) non-leaf overflow (d) new root (a) Insert key = 32 (a) Insert key = 7 (c) Insert key = 160 (d) New root, insert 45 Insertion Find correct leaf L. Put data entry onto L. If L has enough space, done! Else, must split L (into L and a new node L2) Redistribute entries evenly, copy up middle