Multi way&btree

1

Multi-Way B Tree

2

Multi-way Search Trees

� Properties

� Generalization of binary search tree

� Node contains 1…k keys (in sorted order)

� Node contains 2…k+1 children

� Keys in jth child < jth key < keys in (j+1)th child

� Examples

5 12

2 178

5 8 15 33

1 3 19 2197 44

3

Types of Multi-way Search Trees

� 2-3 tree

� Internal nodes have 2 or 3 children

� Index search trie

� Internal nodes have up to 26 children (for strings)

� B-tree

� T = minimum degree

� Non-root internal nodes have T-1 to 2T-1 children

� All leaves have same depth

T-1 … 2T-1

1 2T2 …

5 12

2 178

c

a so

4


� Search algorithm1. Compare key x to 1…k keys in node

2. If x = some key then return node

3. Else if (x < key j) search child j

4. Else if (x > all keys) search child k+1

� Example

� Search(17)

5 12

1 2 178

30 40

25

27 4436

5


� Insert algorithm

1. Search key x to find node n

2. If ( n not full ) insert x in n

3. Else if ( n is full )

a) Split n into two nodes

b) Move middle key from n to n’s parent

c) Insert x in n

d) Recursively split n’s parent(s) if necessary

6


� Insert Example (for 2-3 tree)

� Insert( 4 )

5 12

2 178

5 12

2 4 178

7


� Insert Example (for 2-3 tree)

� Insert( 1 )

5 12

1 2 4 178

2 5 12

2

1 1784

5

12

1 1784

Split parentSplit node

8

B-Trees

9

Motivation for B-Trees

� So far we have assumed that we can store an entire data structure in main memory

� What if we have so much data that it won’t fit?

� We will have to use disk storage but when this happens our time complexity fails

� The problem is that Big-Oh analysis assumes that all operations take roughly equal time

� This is not the case when disk access is involved

10

Motivation (cont.)

� Assume that a disk spins at 3600 RPM

� In 1 minute it makes 3600 revolutions, hence one revolution occurs in 1/60 of a second, or 16.7ms

� On average what we want is half way round this disk – it will take 8ms

� This sounds good until you realize that we get 120 disk accesses a second – the same time as 25 million instructions

� In other words, one disk access takes about the same time as 200,000 instructions

� It is worth executing lots of instructions to avoid a disk access

11

Motivation (cont.)

� Assume that we use an AVL tree to store all the car driver details in UK (about 20 million records)

� We still end up with a very deep tree with lots of different disk accesses; log2 20,000,000 is about 24, so this takes about 0.2 seconds (if there is only one user of the program)

� We know we can’t improve on the log n for a binary tree

� But, the solution is to use more branches and thus less height!

� As branching increases, depth decreases

12

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 / 2children

4.the root is either a leaf node, or it has from two to mchildren

5.a leaf node contains no more than m – 1 keys

� The number m should always be odd

13

An example B-Tree

51 6242

6 12

26

55 60 7064 9045

1 2 4 7 8 13 15 18 25

27 29 46 48 53

A B-tree of order 5 containing 26 items

Note that all the leaves are at the same levelNote that all the leaves are at the same level

14

� Suppose we start with an empty B-tree and keys arrive in the following order:1 12 8 2 25 5 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

Constructing a B-tree

1 2 8 12

15

Constructing a B-tree (contd.)

1 2

8

12 25

6, 14, 28 get added to the leaf nodes:

1 2

8

12 146 25 28

16


Adding 17 to the right leaf node would over-fill it, so we take the

middle key, promote it (to the root) and split the leaf

8 17

12 14 25 281 2 6

7, 52, 16, 48 get added to the leaf nodes

8 17

12 14 25 281 2 6 16 48 527

17


Adding 68 causes us to split the right most leaf, promoting 48 to the

root, and adding 3 causes us to split the left most leaf, promoting 3

to the root; 26, 29, 53, 55 then go into the leaves

3 8 17 48

52 53 55 6825 26 28 291 2 6 7 12 14 16

Adding 45 causes a split of 25 26 28 29

and promoting 28 to the root then causes the root to split

18


17

3 8 28 48

1 2 6 7 12 14 16 52 53 55 6825 26 29 45

19

Inserting into a B-Tree

� Attempt to insert the new key into a leaf

� If this would result in that leaf becoming too big, split the leaf into two, promoting the middle key to the leaf’s parent

� If this would result in the parent becoming too big, split the parent into two, promoting the middle key

� This strategy might have to be repeated all the way to the top

� If necessary, the root is split in two and the middle key is promoted to a new root, making the tree one level higher

20

Exercise in Inserting a B-Tree

� Insert the following keys to a 5-way B-tree:

� 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35, 56

� Check your approach with a neighbour and discuss any differences.

21

Removal from a B-tree

� During insertion, the key always goes into a leaf. For deletion we wish to remove from a leaf. There are three possible ways we can do this:

� 1 - If the key is already in a leaf node, and removing it doesn’t cause that leaf node to have too few keys, then simply remove the key to be deleted.

� 2 - If the key is not in a leaf then it is guaranteed (by the nature of a B-tree) that its predecessor or successor will be in a leaf -- in this case can we delete the key and promote the predecessor or successor key to the non-leaf deleted key’s position.

22

Removal from a B-tree (2)

� If (1) or (2) lead to a leaf node containing less than the minimum number of keys then we have to look at the siblings immediately adjacent to the leaf in question:

� 3: if one of them has more than the min’ number of keys then we can promote one of its keys to the parent and take the parent key into our lacking leaf

� 4: if neither of them has more than the min’ number of keys then the lacking leaf and one of its neighbours can be combined with their shared parent (the opposite of promoting a key) and the new leaf will have the correct number of keys; if this step leave the parent with too few keys then we repeat the process up to the root itself, if required

23

Type #1: Simple leaf deletion

1212 2929 5252

22 77 99 1515 2222 5656 6969 72723131 4343

Delete 2: Since there are enough

keys in the node, just delete it

Assuming a 5-way

B-Tree, as before...

Note when printed: this slide is animated

24

Type #2: Simple non-leaf deletion

1212 2929 5252

77 99 1515 2222 5656 6969 72723131 4343

Delete 52

Borrow the predecessoror (in this case) successor

5656


25

Type #4: Too few keys in node and

its siblings

1212 2929 5656

77 99 1515 2222 6969 72723131 4343

Delete 72Too few keys!

Join back together


26

Type #4: Too few keys in node and

its siblings

1212 2929

77 99 1515 2222 696956563131 4343


27

Type #3: Enough siblings

1212 2929

77 99 1515 2222 696956563131 4343

Delete 22

Demote root key andpromote leaf key


28

Type #3: Enough siblings

1212

292977 99 1515

3131

696956564343


29

Exercise in Removal from a B-Tree

� Given 5-way B-tree created by these data (last exercise):

� 3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35, 56

� Add these further keys: 2, 6,12

� Delete these keys: 4, 5, 7, 3, 14

� Again, check your approach with a neighbour and discuss any differences.

30

Analysis of B-Trees

� The maximum number of items in a B-tree of order m and height h:

root m – 1

level 1 m(m – 1)

level 2 m2(m – 1)

. . .

level h mh(m – 1)

� So, the total number of items is

(1 + m + m2 + m3 + … + mh)(m – 1) =

[(mh+1 – 1)/ (m – 1)] (m – 1) = mmhh+1+1 –– 11

� When m = 5 and h = 2 this gives 53 – 1 = 124

31

Reasons for using B-Trees

� When searching tables held on disc, the cost of each disc transfer is high but doesn't depend much on the amount of data transferred, especially if consecutive items are transferred

� If we use a B-tree of order 101, say, we can transfer each node in one disc read operation

� A B-tree of order 101 and height 3 can hold 1014 – 1 items (approximately 100 million) and any item can be accessed with 3 disc reads (assuming we hold the root in memory)

� If we take m = 3, we get a 2-3 tree, in which non-leaf nodes have two or three children (i.e., one or two keys)

� B-Trees are always balanced (since the leaves are all at the same level), so 2-3 trees make a good type of balanced tree

32

Comparing Trees

� Binary trees

� Can become unbalanced and lose their good time complexity (big O)

� Heaps remain balanced but only prioritise (not order) the keys

� Multi-way trees

� B-Trees can be m-way, they can have any (odd) number of children

� One B-Tree, the 2-3 (or 3-way) B-Tree, approximates a permanently balanced binary tree, exchanging the AVL tree’s balancing operations for insertion and (more complex) deletion operations

Technology

Multi way&btree