B-Trees

Table of Contents

B-Trees

Data Layout on Disk

Disk Block Access Time

Considerations for Disk Based Dictionary Structures

Indexed Sequential Access Method (ISAM)

ISAM (Continued)

ISAM (Continued)

ISAM Limitations

A Solution: B-Trees

B-Tree Example with m = 5

Insert 10

Insert 11

Insert 11 (Continued)

Remove 8

Remove 8 (Continued)

Remove 13

Remove 13 (Cont)

Remove 11

Remove 11 (Cont)

Remove 2

Remove 2 (Cont)

Remove 2 (Cont)

Insert 49

Insert 49 (Cont)

Insert 49 (Cont)

B-Tree performance

2-3 Trees

Email: tanimoto@cs.washington.edu

Home Page: www.cs.washington.edu/people/faculty/tanimoto.html

Download presentation source