Multilevel Indexing and

B+ Trees

Indexed Sequential Files

Provide a choice between two alternative

views of a file:
1. Indexed: the file can be seen as a set of
records that is indexed by key; or
2. Sequential: the file can be accessed
sequentially (physically contiguous
records), returning records in order by
key.
2

Example of applications
Student record system in a university:
Indexed view: access to individual records
Sequential view: batch processing when posting
grades

Credit card system:

Indexed view: interactive check of accounts
Sequential view: batch processing of payments

The initial idea

Maintain a sequence set:
Group the records into blocks in a sorted way.
Maintain the order in the blocks as records are
added or deleted through splitting,
concatenation, and redistribution.

Construct a simple, single level index for

these blocks.
Choose to build an index that contain the key
for the last record in each block.
4

Maintaining a Sequence Set

Sorting and re-organizing after insertions and
deletions is out of question. We organize the
sequence set in the following way:
Records are grouped in blocks.
Blocks should be at least half full.
Link fields are used to point to the preceding block and
the following block (similar to doubly linked lists)
Changes (insertion/deletion) are localized into blocks
by performing:
Block splitting when insertion causes overflow
Block merging or redistribution when deletion causes
underflow.
5

Example: insertion
Block size = 4
Key : Last name
Block 1 ADAMS

BIXBY

CARSON COLE

Insert BAIRD :
Block 1

ADAMS BAIRD

Block 2 CARSON ..

BIXBY

COLE

Example: deletion
Block 1 ADAMS

BAIRD

BIXBY

Block 2 BYNUM

CARSON ..

CARTER ..

Block 3

BOONE

DENVER ELLIS

Block 4 COLE

DAVIS

Delete DAVIS, BYNUM, CARTER,

Add an Index set

Key

Block

BERNE
CAGE
DUTTON
EVANS
FOLK
GADDIS

1
2
3
4
5
6

Tree indexes
This simple scheme is nice if the index fits in
memory.
If index doesnt fit in memory:
Divide the index structure into blocks,
Organize these blocks similarly building a tree
structure.

Tree indexes:

B Trees
B+ Trees
Simple prefix B+ Trees

Separators
Block
1

Range of Keys

Separator

ADAMS-BERNE
BOLEN

BOLEN-CAGE
CAMP

CAMP-DUTTON
EMBRY

EMBRY-EVANS
FABER

FABER-FOLK
FOLKS

FOLKS-GADDIS

10

root
EMBRY

Index set

BOLEN

ADAMS-BERNE

CAMP

FABER

CAMP-DUTTON
BOLEN-CAGE

FOLKS

EMBRY-EVANS

FOLKS-GADDIS
FABER-FOLK

5
11

B Trees
B-tree is one of the most important data structures
in computer science.
What does B stand for? (Not binary!)
B-tree is a multiway search tree.
Several versions of B-trees have been proposed,
but only B+ Trees has been used with large files.
A B+tree is a B-tree in which data records are in
leaf nodes, and faster sequential access is possible.

12

Formal definition of B+ Tree Properties

Properties of a B+ Tree of order v :
All internal nodes (except root) has at least v keys
and at most 2v keys .
The root has at least 2 children unless its a leaf..
All leaves are on the same level.
An internal node with k keys has k+1 children

13

B+ tree: Internal/root node

structure
P0 K1 P1 K2

Pn-1 Kn Pn

Each Pi is a pointer to a child node; each Ki is a search key value

# of search key values = n, # of pointers = n+1

Requirements:
K1 < K 2 < < K n
For any search key value K in the subtree pointed by Pi,
If Pi = P0, we require K < K1
If Pi = Pn, Kn K
If Pi = P1, , Pn-1, Ki < K Ki+1
14

B+ tree: leaf node structure

L

K 1 r1 K 2

K n rn R

Pointer L points to the left neighbor; R points to

the right neighbor
K1 < K2 < < Kn
v n 2v (v is the order of this B+ tree)
We will use Ki* for the pair <Ki, ri> and omit L and
R for simplicity
15

Example: B+ tree with order of 1

Each node must hold at least 1 entry, and at most
2 entries
Root
40

10*

15*

20

33

20*

27*

51

33*

37*

40*

46*

51*

63

55*

63*

97*

16

Example: Search in a B+ tree order 2

Search: how to find the records with a given search key value?
Begin at root, and use key comparisons to go to leaf

Examples: search for 5*, 16*, all data entries >= 24* ...
The last one is a range search, we need to do the sequential scan, starting from
the first leaf containing a value >= 24.
Root

13

2*

3*

5*

7*

14* 15*

17

24

19* 20* 22*

30

24* 27* 29*

33* 34* 38* 39*

17

How to Insert a Data Entry into a

B+ Tree?
Lets look at several examples first.

18

Inserting 16*, 8* into Example B+ tree

Root

2*

3*

5*

7*

8*

13

17

24

30

15* 16*

14*

You overflow
13

2*

3*

5*

7*

17

24

30

8*

One new child (leaf node)

generated; must add one more
pointer to its parent, thus one more
key value as well.

19

Inserting 8* (cont.)
Copy up the
middle value
(leaf split)

13

17

24

30
Entry to be inserted in parent node.
(Note that 5 is
s copied up and
continues to appear in the leaf.)

2*

3*

13

5*

17

24

30

7*

8*

You overflow!

20

Insertion into B+ tree (cont.)

Understand
difference
between copy-up
and push-up
Observe how
minimum
occupancy is
guaranteed in
both leaf and
index pg splits.

13

17

24

30

We split this node, redistribute entries evenly,

and push up middle key.

17

13

24

Entry to be inserted in parent node.

(Note that 17 is pushed up and only
appears once in the index. Contrast
this with a leaf split.)
30

21

Example B+ Tree After Inserting 8*

Root
17

2*

3*

24

13

5*

7* 8*

14* 15*

19* 20* 22*

30

24* 27* 29*

33* 34* 38* 39*

Notice that root was split, leading to increase in height.

22

Inserting a Data Entry into a B+ Tree:

Summary

Find correct leaf L.

Put data entry onto L.

If L has enough space, done!

Else, must split L (into L and a new node L2)
Redistribute entries evenly, put middle key in L2
copy up middle key.
Insert index entry pointing to L2 into parent of L.

This can happen recursively

To split index node, redistribute entries evenly, but push

up middle key. (Contrast with leaf splits.)

Splits grow tree; root split increases height.

Tree growth: gets wider or one level taller at top.

23

Deleting a Data Entry from a B+

Tree
Examine examples first

24

Delete 19* and 20*

Root
17

2*

3*

24

13

5*

7* 8*

14* 16*

19* 20* 22*

30

24* 27* 29*

33* 34* 38* 39*

w
rflo
e
d
22*
un
You

22* 24*

27* 29*

Have we still forgot something?

25

Deleting 19* and 20* (cont.)

Root
17

2*

3*

27

13

5*

7* 8*

14* 16*

22* 24*

30

27* 29*

33* 34* 38* 39*

Notice how 27 is copied up.

But can we move it up?
Now we want to delete 24
Underflow again! But can we redistribute this time?

26

g!
n
w
li
flo sib
r
de ith
n
u
u ew
o
Y erg
M

Deleting 24*

Observe the two leaf

nodes are merged, and
27 is discarded from
their parent, but
Observe `pull down of
index entry (below).
New root

2*

3*

5*

7*

8*

13

14* 16*

30

22*

17

27*

29*

33*

34*

38*

39*

30

22* 27* 29*

33* 34* 38* 39*

27

Deleting a Data Entry from a B+ Tree:

Summary
Start at root, find leaf L where entry belongs.
Remove the entry.

If L is at least half-full, done!

If L has only d-1 entries,
Try to re-distribute, borrowing from sibling (adjacent node
with same parent as L).
If re-distribution fails, merge L and sibling.

If merge occurred, must delete entry (pointing to L or

sibling) from parent of L.
Merge could propagate to root, decreasing height.
28

Example of Non-leaf Re-distribution

Tree is shown below during deletion of 24*. (What
could be a possible initial tree?)
In contrast to previous example, can re-distribute entry
from left child of root to right child.
Root
22

2* 3*

5* 7* 8*

13

14* 16*

17

30

20

17* 18*

20* 21*

22* 27* 29*

33* 34* 38* 39*

29

After Re-distribution
Intuitively, entries are re-distributed by `pushing
through the splitting entry in the parent node.
It suffices to re-distribute index entry with key 20;
weve re-distributed 17 as well for illustration.
Root
17

2* 3*

5* 7* 8*

13

14* 16*

20

17* 18*

20* 21*

22

30

22* 27* 29*

33* 34* 38* 39*

30