**This is an old revision of the document!**

The objectives are

  • Identify properties of relations
  • Apply relational operators (excepting join)
  • Prove properties of relational operators
  • Represent binary-relations as graphs
  • Represent binary-relations as matrixes


The book notation and the class notation is slightly different. Here is how the two are related given that $R$ and $S$ are relations:

  • The select operation is identified by $\sigma_C\ R$ in class, but $s_C(R)$ in the book. In both cases $C$ is an expression that determines when a row is selected and when it is not.
  • The project operation is identified by $\pi_{i_1i_2i_3\ldots}\ R$ in class but $P_{i_1i_2i_3\ldots}(R)$ in the book. In both cases, the columns in the subscript are the columns that remain.
  • The natural join operation is identified by $R \bowtie S$ in class, but $J_p(R,S)$ in the book.
  • The book does not define a rename operation identified by $\rho_{A \leftarrow B}\ R$ to indicate that $A$ becomes $B$ in the schema.

All problems are worth 3 points and reference problems in the course text.

  1. (4 points) 9.1.4
  2. (8 points) 9.1.6
  3. (2 points) 9.1.10
  4. (1 point)9.1.12
  5. (2 points) 9.1.38
  6. (5 points) 9.1.50
  7. (2 points) 9.2.26
  8. (2 points) 9.2.28
  9. (5 points) 9.3.14
  10. (1 points) 9.3.28
  11. (1 points) 9.4.26 part a only
cs-236/homework-7.1434053043.txt.gz · Last modified: 2015/06/11 14:04 by egm
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0