Table of Contents
Layers of a DBMS
The Memory Hierarchy
Disk Space Manager
Buffer Management in a DBMS
Buffer Manager
Record Formats: Fixed Length
Files of Records
File Organizations
Cost Model for Our Analysis
Sorting
2-Way Sort: Requires 3 Buffers
Two-Way External Merge Sort
General External Merge Sort
Cost of External Merge Sort
Number of Passes of External Sort
Cost Model for Our Analysis
Assumptions in Our Analysis
Cost of Operations
Cost of Operations
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
Email: zives@cs.washington.edu
Home Page: http://www.cs.washington.edu/homes/zives
Download presentation source
|