Professional Documents
Culture Documents
Definition of a B-tree
A B-tree of order m is an m-way tree (i.e., a tree where each node may have up to m children) in which:
1. the number of keys in each non-leaf node is one less than the number of its children and these keys partition the keys in the children in the fashion of a search tree 2. all leaves are on the same level 3. all non-leaf nodes except the root have at least m / 2 children 4. the root is either a leaf node, or it has from two to m children 5. a leaf node contains no more than m 1 keys
An example B-Tree
26 6 12
42
1 2 4 7 8 13 15 18 25
51
62
27
29
45
46
48
53
55
60
64
70
90
Constructing a B-tree
Suppose we start with an empty B-tree and keys arrive in the following order:1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45 We want to construct a B-tree of order 5 The first four items go into the root: To put the fifth item in the root would violate condition 5 Therefore, when 25 arrives, pick the middle key to make a new root
1 2 8 12
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
Constructing a B-tree
Add 25 to the tree
8 12 25
28
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
6 2
17 12 14 25 28 28
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
8 17
7 6
12 14 16
25 28 52 48
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
8 17
6 7
12 14 16
25 28 48 52 68
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
2 3
6 7
12 14 16
25 28
52 68
1 12 8 2 25 6 14 28 17 7 52 16 48 68 3 26 29 53 55 45
12 14 16
25 28 26 29
52 68 53 55
1 12 8 2 25 Exceeds Order. Add 45 increases the trees level 6 Promote middle and 14 split. 28 17 7 Exceeds Order. 52 Promote middle and 16 3 8 17 48 split. 48 68 3 26 6 7 12 14 16 25 26 28 29 45 52 53 55 68 29 1 2 53 55 45
Answer to Exercise
12 29 52
15 22
31 43
56 69 72
Delete 2: Since there are enough keys in the node, just delete it
Note when printed: this slide is animated
12 29 52 56
15 22
31 43
56 69 72
15 22
31 43
69 72
Too few keys! Delete 72
15 22
31 43 56 69
15 22
31 43 56 69
Delete 22
15 29
43 56 69
Answer to Exercise
Analysis of B-Trees
The maximum number of items in a B-tree of order m and height h:
root level 1 level 2 . . . level h m1 m(m 1) m2(m 1) mh(m 1)
So, the total number of items is (1 + m + m2 + m3 + + mh)(m 1) = [(mh+1 1)/ (m 1)] (m 1) = mh+1 1 When m = 5 and h = 2 this gives 53 1 = 124 Farmula is lr-a/r-a of g.p
B+ TREES
While processing data from a large file systems, we often need to process data both randomly and sequentially. Although B trees is an efficient way for processing data randomly but it is not suitable for rapid sequential access. This is because a lot processing time is consumed while moving up and down the tree structure during sequential access. This inefficiency of B tree is overcome in B+ Trees. B+ Tree is a variant of BTrees in which all key values are maintained in leaf nodes and also key values are replicated in non leaf nodes so as to define paths for locating individual data .The leaf nodes are also linked together so that all key values in B+ trees can be traversed sequentially.
In a B+ tree, in contrast to a B-tree, all records are stored at the leaf level of the tree; only keys are stored in interior nodes. The primary value of a B+ tree is in storing data for efficient retrieval in a block-oriented storage contextin particular, file systems. Because of the way B+-Trees store records at the leaf level of the tree, they maximize the branching factor of the internal nodes. High branching factor allows for a tree of lower height. Lower tree height allows for less disk I/O. Less disk I/O theoretically means better performance. The NTFS, ReiserFS, NSS, XFS, JFS, and ReFS filesystems all use this type of tree for metadata indexing.Relational database management systems such as Microsoft SQL Server,Oracle 8,SybasASE,and SQLite support this type of tree for table indices.