Table of Contents
Tree-Structured Indexes
Introduction
Range Searches
ISAM
Comments on ISAM
Example ISAM Tree
After Inserting 23*, 48*, 41*, 42* ...
... then Deleting 42*, 51*, 97*
B+ Tree: The Most Widely Used Index
Example B+ Tree
B+ Trees in Practice
Inserting a Data Entry into a B+ Tree
Inserting 8* into Example B+ Tree
Example B+ Tree After Inserting 8*
Review from last time
B+ Tree Review
B+-Trees in Practice
Insertion Revisited
Deleting a Data Entry from a B+ Tree
Example Tree After (Inserting 8*, Then) Deleting 19* and 20* ...
... And Then Deleting 24*
Example of Non-leaf Re-distribution
After Re-distribution
Index-Level Re-distribution
Prefix Key Compression
Bulk Loading of a B+ Tree
Bulk Loading (Contd.)
Summary of Bulk Loading
A Note on `Order’
Summary
Summary (Contd.)
|
Author: Joe Hellerstein/Raghu Ramakrishnan
Email: cs186@cory.eecs.berkeley.edu
Home Page: http://www-inst.eecs.berkeley.edu/~cs186/
|