B-Trees

1. B-Trees By: Nathan Hancock RJ Smith

2. B-Trees-What Are They A B-tree is a specialized multiway tree designed especially for use on disk. Each node may contain a large number of keys. The number of subtrees of each node, then, may also be large. A B-tree is designed to branch out in this large number of directions and to contain a lot of keys in each node so that the height of the tree is relatively small. The goal is to get fast access to the data, and with disk drives this means reading a very small number of records.

3. 12 22 30 31 How They Work Add to B-Tree: 12, 22, 30, 31, 77, 19, 37, 45, 41, 3, 35, 39, 52, 14

4. 30 31 77 12 22 How They Work Insert 77

5. 30 31 37 45 77 12 19 22 How They Work Insert 19, 37, 45

6. 30 31 37 45 77 12 19 22 How They Work Insert 41 41

7. 30 45 77 12 19 22 31 37 How They Work Insert 41 41

8. 30 41 45 52 77 19 22 31 35 39 37 3 12 How They Work Insert 3, 35, 39, 52

9. 30 41 45 52 77 19 22 31 35 39 37 3 12 How They Work Insert 23 23

10. 19 30 41 45 22 52 77 23 31 35 39 37 3 12 How They Work Insert 23