Download presentation

Presentation is loading. Please wait.

Published byJacquelyn Pooler Modified over 2 years ago

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

4
How They Work Insert

5
How They Work 30 Insert 19, 37,

6
How They Work 30 Insert

7
How They Work Insert

8
How They Work Insert 3, 35, 39,

9
How They Work Insert

10
How They Work Insert

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google