ECE356 Lecture Notes - Lecture 16: Database Server, Rela, Relational Algebra

• School: University of Waterloo
• Department: Electrical and Computer Engineering
• Course: ECE356
• Professor: Zarnett

Document Summary

Imagine you are given an assignment in a course and you are going to do it now. To break these steps down into more detail, as in [en11], the steps are a bit more like this. First, the scanner needs to gure out what are keywords and attribute names and relation names to gure out the text of the query. The parser will then check that it is valid sql syntax. If so, then it will be validated to make sure that the attribute and relation names are valid inside the schema of the database being queried. Then this query is turned into a query tree or graph, which is used to devise the execution strategy. A quick visual summary of all the steps we are going to go through [sks11]: We will not spend time talking about the scanning, parsing, and veri cation steps of query processing. We therefore will give them no further consideration.