COMPSCI 61A Lecture 32: CS61A-Lecture 11-14-2016

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Homework party monday 11/14 6:30-8:30pm in 247 cory. Bonus point for submitting a complete project by wednesday 11/16 @ Project party wednesday 11/16 6:30-8:30pm in 247 cory. The completely optional scheme recursive art contest entries are due monday. Two tables a & b are joined by a comma to yield all combos of a row from a & a row from b. Joining exhaustively yields all pairs of rows from a and row b but the where clause must be used to de ne some relationship between the pairs. When two di erent tables have the same column name, we want to be able to pick out one column in one particular table. Two tables may share a column name; dot expressions and aliases disambiguate column values. [table] is a comma-separated list of table names with optional aliases. Using an alias to look at all pairs of rows in parents, which is important to identify the siblings.