B-Trees

• B-Trees are specialized M-ary search trees

• Each node has many keys

  • subtree between two keys x and y contains values v such that x ? v < y
  • binary search within a node
    to find correct subtree

• Each node takes one

full {page, block, line}

of memory

xɛ

3?xɟ

7?x᝼

12?xច

21?x

Previous slide

Next slide

Back to first slide

View graphic version