Instructor: Dr. R. Rosebrugh, Dunn 203
The course meeting time is 9:30MWF in AD G9 (Note change). Help with assignments or projects is available other times by appointment; contact the instructor by email.
The textbook is Database Systems: the complete book by Garcia-Molina, Ullman and Widom. We will cover all of chapters 1-10 and selected topics from chapters 11-20. Also recommended is An Introduction to Database Systems (8th ed) by C. J. Date.
The page for the Garcia-Molina-Ullman-Widom book (including lecture notes) is at http://www-db.stanford.edu/~ullman/dscb.html ;
Check this URL regularly for information about the course.
There will be written assignments, in-class quizzes, midterm tests, and a project.
The project will will be done in small groups, will be assigned by late January and will be completed near the end of term.
Grades will be assigned using approximately the following weights:
The Project description is at 381107pr.html .
From the text: 2.1.3, 2.1.5, 2.1.10, 2.2.6, 2.3.4.
Due January 19.
Please attempt the other text problems.
1. Does the relational operator product commute with intersection? With difference? (In each case your answer must be either a proof of equality or a proof that equality fails, i.e. a counterexample.)
2. Show that duplicate elimination commutes with natural join.
3. Does duplicate elimination commute with union? With difference? (Same comment as with 1.)
4. For the relation scheme R(BOSQID)let the dependencies F = { S -> D, I -> B, IS -> Q, B -> O} hold.
(It might help to think of an investment firm with Brokers, Offices, Stocks, Quantities(of stock), Investors
and Dividends(paid).
a) Find a key for R.
b) How many keys does R have? (prove your answer!)
c) Find a lossles join BCNF decomposition.
d) Find a dependency-preserving, lossless join 3NF
Due April 5.