COMPSCI 61A Lecture Notes - Lecture 33: Srinivasa Ramanujan, Elano, Init

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

Document Summary

Bonus point for submitting a complete project by wednesday 11/16 @ 11:59pm. Project party wednesday 11/16 6:30-8:30pm in 247 cory. The completely optional scheme recursive art contest due monday 11/28 @ 11:59pm. Perform operations on tables that programmers specify in select statements (e. g. joining tables) where clause lters according to an expression the column descriptions just after the word select tell you how to compute the. Nal result columns mapping over the resulting rows after ltering. Relational query processor parses and executes sql statements. Query rewrite, query optimizer, and plan executor (executes plan from query. Decides how to execute your query in a way that it thinks is most e cient, given multiple options that result in the same output. Transactional storage managers make sure that nothing breaks when two di erent users are accessing and updating the same database at the same time. The manner in which tables are ltered, sorted, and joined a ects execution time.