Table of Contents
Tree-Structured Indexes
Introduction
Range Searches
Tree-structured index
ISAM
Example ISAM Tree
After Inserting 23*, 48*, 41*, 42* ...
... Then Deleting 42*, 51*, 97*
B+ Trees
Example B+ Tree
B+ Trees
Inserting a Data Entry into a B+ Tree
Example B+ Tree
Inserting 8* into Example B+ Tree
Example B+ Tree After Inserting 8*
Deleting a Data Entry from a B+ Tree
Example B+ Tree After Inserting 8*
Example Tree After Deleting 19* and 20* ...
... And Then Deleting 24*
Performance considerations
Summary
Summary (Contd.)
|
Author: Marek Rusinkiewicz
|