Lecture 8. Operator algorithms

Readings:

• Leonard Shapiro. Join processing in database systems with large main memories. ACM Transactions on Database Systems 11(3), 1986. Also in Red Book (3rd and 4th ed) [pdf]

As you read this paper, consider the following questions:

• The paper presents four algorithms for computing the join of two relations when neither relation can fit entirely in main memory. What key techniques do these algorithms use? How do they differ?
• What assumptions underly the different algorithms and what can be done if these assumptions do not hold?

Lecture notes:

• lecture8.pdf

Additional resources:

• Chapters 13 and 14 (in R&G, third edition).

Optional, additional readings:

• A. Ailamaki, D. J. DeWitt, M. D. Hill, D. A. Wood. DBMSs on a Modern Processor: Where Does Time Go? VLDB 1999. [pdf]