Indexing

10/20/99


Click here to start


Table of Contents

Indexing

Introduction

Introduction (cont’d.)

Alternatives for Data Entry k* in Index

Alternatives for Data Entries (Contd.)

Alternatives for Data Entries (Contd.)

Index Classification

Clustered vs. Unclustered Index

Index Classification (Contd.)

Tree-Structured Indices

ISAM

Example ISAM Tree

Comments on ISAM

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*

Deleting a Data Entry from a B+ Tree

Example Tree After (Inserting 8*, Then) Deleting 19* and 20* ...

... And Then Deleting 24*

Summary

Summary

Summary (Contd.)

Email: vandenbe@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/594/99au/

Download presentation source