Presentation is loading. Please wait.

Presentation is loading. Please wait.

B-Trees By: Nathan Hancock RJ Smith. B-Trees-What Are They A B-tree is a specialized multiway tree designed especially for use on disk. Each node may.

Similar presentations


Presentation on theme: "B-Trees By: Nathan Hancock RJ Smith. B-Trees-What Are They A B-tree is a specialized multiway tree designed especially for use on disk. Each node may."— Presentation transcript:

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 How They Work 12313022 Add to B-Tree: 12, 22, 30, 31, 77, 19, 37, 45, 41, 3, 35, 39, 52, 14

4 How They Work 30 1222 Insert 77 3177

5 How They Work 30 Insert 19, 37, 45 121922 31773745

6 How They Work 30 Insert 41 121922 31773745 41

7 How They Work Insert 41 121922 7745 30 3137 41

8 How They Work Insert 3, 35, 39, 52 3041 12 1922 3 52 45 77 39373135

9 How They Work Insert 23 3041 12 1922 3 52 45 77 39373135 23

10 How They Work Insert 23 22 2352 45 77 39373135 304119 123


Download ppt "B-Trees By: Nathan Hancock RJ Smith. B-Trees-What Are They A B-tree is a specialized multiway tree designed especially for use on disk. Each node may."

Similar presentations


Ads by Google