8.Btree

This section explains the concept, its importance, and when to use it.

8.Btree

B-TREE

1971: Rudolf Bayer and Ed McCreight

EXTERNAL MEMORY VERSUS RAM

ACCESS TIMES

INSErT OPERATION

SEARCH OPERATION

Deletion: REMOVE OPERATION

VARIANTS

It is basically the original B-tree structure

B*-trees keep each node at least 2/3 full instead of just 1/2 by redistributing keys until 2 child nodes are full

In order traversal