Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn Harvard CS 165
·
Module 3
Query Execution: Scans, Sorting, and Joins
1
B+ Tree Indexing vs. Full Table Scan: A Cost Analysis
Implement an index-based selection operator using a B+ tree and analyze its cost versus a full table scan.
2
External Merge Sort: Runs and Multi-way Merging
Implement external merge sort, including the creation of sorted runs and the multi-way merge pass.
3
Optimizing External Merge Sort for Projection with Duplicate Elimination
Analyze the I/O cost of external merge sort and its use for projection with duplicate elimination.
4
Analyzing Block Nested Loop Join I/O Costs
Implement and analyze the I/O cost of the block nested loop join algorithm.
5
Analyzing I/O Costs of Index Nested Loop Join
Implement and analyze the I/O cost of the index nested loop join algorithm.
6
Sort-Merge Join: I/O Cost Analysis
Implement and analyze the I/O cost of the sort-merge join algorithm.
7
Two-Pass Grace Hash Join Implementation
Implement a two-pass grace hash join, including the partitioning and probing phases.
8
Join Strategy Performance Comparison
Compare the performance trade-offs between nested loop, sort-merge, and hash join strategies.
Previous module
Indexing Structures: B+ Trees and Hashing
Next module
Query Optimization