1) The SQL statement is decomposed into relational algebra query that 's analyzed to see whether it's syntactically correct.
2) The query then undergoes semantic checking.
3) The data dictionary is consulted to ensure that the tables and the individual columns that are REFERENCED in the query do exist,as well as all the object privileges.
4) The column types are checked to ensure that the data MATCHES the column definition.
5) The statement is normalized so that it can be processed more efficiently
6) The query is rejected if it is incorrectly formulated
7) Once the parse tree passes all the syntactic and semantic checks,it is CONSIDERED a valid parse tree,and it's sent to the logical query plan generation stage.

1) The SQL statement is decomposed into relational algebra query that 's analyzed to see whether it's syntactically correct.
2) The query then undergoes semantic checking.
3) The data dictionary is consulted to ensure that the tables and the individual columns that are referenced in the query do exist,as well as all the object privileges.
4) The column types are checked to ensure that the data matches the column definition.
5) The statement is normalized so that it can be processed more efficiently
6) The query is rejected if it is incorrectly formulated
7) Once the parse tree passes all the syntactic and semantic checks,it is considered a valid parse tree,and it's sent to the logical query plan generation stage.