Module
Indexing and Access Methods
Sign in to add this module to your path and practice.
About
Dense/sparse indexes, ISAM, B+ trees (structure, search, insert/delete, bulk-loading), static and dynamic (extendible/linear) hashing, multi-dimensional and bitmap indexes (overview), and index selection trade-offs.
Goal
Analyze I/O cost of operations on B+ trees and hash indexes; choose and justify indexes for given workloads; outline insert/delete maintenance.
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Indexing and Access Methods. Ask about the concepts, goal, or where you're stuck.