Csci 2111: Data and File StructuresWeek 8, Lectures 1 & 2

Statement of the Problem

Indexing with Binary Search Trees: Negative Aspects

Indexing with Binary Search Trees: Positive Aspects

AVL Trees I

AVL Trees II

AVL Tree III

Paged Binary Trees

Problems with Paged Trees I

Problems with Paged Trees II

Multi-Level Indexing: A Better Approach to Tree Indexes

B-Trees: Addressing the problems of Paged Trees and Multi-Level Indexing

B-Trees: An Overview

Example of a B-Tree

How do B-Trees work? Main Ideas

Searching a B-Tree

Insertion into a B-Tree: General Strategy

Insertion into a B-Tree: No Split & Contained Splits

Insertion into a B-Tree: Recursive Split

Formal Definition of B-Tree Properties

Worst-Case Search Depth I

Worst-Case Search Depth II

Deletion from a B-Tree: Rules for Deleting a key k from a node n

Deletion from a B-Tree: Example

Redistribution during Insertion

Properties of a B* Tree

Email: nat@cs.dal.ca

Home Page: http://borg.cs.dal.ca/~nat