Table of Contents
General External Merge Sort
Cost of Sorting
Cost of External Merge Sort
Number of Passes of External Sort
Storage and Indexing
Cost Model for Our Analysis
File Organizations and Assumptions
Cost of Operations
Cost of Operations
Indexes
Indexes
Alternatives for Data Entry k* in Index
Alternatives for Data Entries (2)
Alternatives for Data Entries (3)
Index Classification
Clustered vs. Unclustered Index
Index Classification (Contd.)
Index Classification (Contd.)
Tree-Based Indexes
Tree-Based Indexes (2)
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*
Deleting a Data Entry from a B+ Tree
Example Tree After (Inserting 8*, Then) Deleting 19* and 20* ...
... And Then Deleting 24*
|
Author: Alon Levy
Email: alon@cs.washington.edu
Home Page: http://www.cs.washington.edu/homes/alon
Download presentation source
|