COS 597D, Fall 2013 
Questions on Codd's Relational Completeness of Data Base Sublanguages

Due at 1:30pm, Wednesday September 25, 2013.
You may hand in a paper copy or email a file to me.
Keep a copy for your use during class discussion.

No credit for late submission.

---

This paper is difficult to read, as much because of the notation as the concepts.   I don't expect you to read all the details, but try to get a high-level understanding of how Codd is mapping relational calculus queries to relational algebra queries, i.e .reducing the relational calculus to the relational algebra.   In your opinion, what are the important ideas?   What do you think is the most conceptually difficult aspect of the reduction?

If you find the paper inscrutable after a couple hours of effort,  outline your own idea for doing the reduction.  What problems do you see with your idea?  I do not expect you to produce a proof, just ideas of how to proceed.