Module 3 · Joins and query optimization · Activity 10 of 32

Lecture 8: Join algorithms

Lecture notes · Carlo Curino

MIT published no notes for this session; the readings below are the material.

Readings and discussion questions

This lecture will cover join algorithms, focusing in particular on Hash Join and Sort-Merge join and the relative tradeoffs of the two approaches.

Read the following paper:

Shapiro, L. D. “Join Processing in Database Systems with Large Main Memories.” In the Red Book.

Assigned by MIT for this session; links go to the papers where MIT linked them. Books: Readings in Database Systems (the Red Book, 4th ed.) and Ramakrishnan & Gehrke.

MIT OpenCourseWare, 6.830 Database Systems, Fall 2010, Prof. Carlo Curino and Prof. Michael Stonebraker. Licensed CC BY-NC-SA 4.0. Reorganized into modules by Sequence 106. No lecture videos were published for this course; each session is notes plus readings. Source · CC BY-NC-SA 4.0