CSE 326: Data Structures Lecture #9 Big, Bad B-Trees

1/28/00


Click here to start


Table of Contents

CSE 326: Data Structures Lecture #9 Big, Bad B-Trees

Today’s Outline

M-ary Search Tree

B-Trees

B-Tree Properties‡

B-Tree Properties

B-Tree Properties

B-Tree Properties

B-Tree Nodes

Example

Making a B-Tree

Splitting the Root

Insertions and Split Ends

Propagating Splits

Insertion in Boring Text

After More Routine Inserts

Deletion

Deletion and Adoption

Deletion with Propagation

Finishing the Propagation (More Adoption)

A Bit More Adoption

Pulling out the Root

Pulling out the Root (continued)

Deletion in Two Boring Slides of Text

Deletion Slide Two

Thinking about B-Trees

A Tree with Any Other Name

Another Way

To Do

Coming Up

 Author: Steve Wolfman

Email: owner-cse326@cs.washington.edu

Home Page: http://www.cs.washington.edu/326/

Download presentation source