Winter 2011 CS 589 Principles of Database Systems

This Document is stored at http://www.cs.pdx.edu/~maier/cs589

Announcements (Last update 14 Mar 2011, 5:45P):

· Answer key to HW 4 posted

· Lecture 4-2 w/ ink posted

· Info on Test 2 posted

Instructor	David Maier maier at cs dot pdx dot edu, 115-14 FAB. Note: Please put ‘cs589’ at the beginning of the subject line.
Phone:	503 725-2406
Class Meeting	Tuesday/Thursday 10:00-11:20, FAB 150
Office Hours	Tuesdays, 2p-3p, or by appointment You are welcome to ask questions by e-mail or phone.

Weekly Schedule

[This schedule is preliminary and subject to change (especially the 2^nd half).]

The class is divided into four units, indicated by color: Unit 1 (yellow),
Unit 2 (blue), Unit 3 (pink), and Unit 4 (green).

Quizzes on (most) Tuesdays, HW Assignments due on Thursdays

Week	Date	Topic	Reading (will be refined)	Slides; Quizzes (Tuesdays)	HW Due (at start of class on Thursdays)
Week 1	Jan. 4	Introduction: Relational Model, Relational Algebra	Ch. 1: Intro, 1.1-1.8, 1.9.1-1.9.3	Lecture 1-1 (revised) Lecture 1-1 w/ink
Week 1	Jan. 6	Tuple Relational Calculus	Section 4.3.1 in Ramakrishnan and Gehrke (the CS 386/586 textbook); Ch. 3: Intro, 3.1, 3.2.1	Lecture 1-2 Lecture 1-2 w/ink
Week 2	Jan. 11	Domain Relational Calculus	Ch. 3: 3.2.2	Quiz 1 Lecture 1-3 Lecture 1-3 w/ink
Week 2	Jan. 13	Introduction to Datalog	Ch. 3: 3.2.3, 3.3	Lecture 1-4 Lecture 1-4 w/ink
Week 3	Jan. 18	Domain Independence, Safety; Equivalence of Relational Query Languages	Ch. 3: 3.4, 3.5, 3.6, 3.6.1-4, 3.6.7 (through Def. 3.70), 3.6.11 (through Example 3.7), 3.6.14 (through Thm. 3.67)	Quiz 2 Lecture 1-5 Lecture 1-5 w/ink
Week 3	Jan. 20	Dependencies and Inference		Lecture 2-1 Lecture 2-1 w/ink	Homework 1 (rev2) assigned Homework 1 key
Week 4	Jan. 25	Dependencies and Inference	Ch. 5: 5.1-5.4, 5.5 (first few pages).	Lecture 2-2 Lecture 2-2 w/ink Quiz 3
	Jan. 27	Dependencies and Inference (cont.)		Lecture 2-3 Lecture 2-3 w/ink	Homework 1 due
	Jan. 27	Dependencies and Inference (cont.)		Lecture 2-3 Lecture 2-3 w/ink	Homework 2 assigned Homework 2 key
Week 5	Feb. 1	Null Values	Ch. 3: 3.6.5, 3.6.6,	Lecture 2-4 Lecture 2-4 w/ink Quiz 4
Week 5	Feb. 3	Null Values (cont.)	Ch. 4: 4.1 (review), 4.2, 4.3, 4.4 (through BCNF), 4.6.1	Lecture 2-5 Lecture 2-5 w/ink	Homework 2 due
Week 6	Feb. 8	Normal Forms and Synthesis
Week 6	Feb. 10	FIRST EXAM	Material from Jan. 3 – Feb. 1		Exam Info Test Key
Week 7	Feb. 15	Algebraic Equivalences and Optimization	Surajit Chaudhuri An overview of query optimization in relational systems (You may need to be in a pdx.edu domain to download this.) [Also see Ch. 15 of Ramakrishnan and Gehrke.] Cesar Galindo-Legaria, Milind Joshi Orthogonal Optimization of Subqueries and Aggregation	Lecture 3-1 Lecture 3-1 w/ink Quiz 5
Week 7	Feb. 17	Algebraic Equivalences and Optimization		Lecture 3-2 Lecture 3-2 w/ink
Week 8	Feb. 22	Algebraic Equivalences and Optimization (cont.)	Ch. 9: Intro, 9.1	Quiz 6
Week 8	Feb. 24	Algebraic Equivalences and Optimization (cont.)	Ch. 9: Intro, 9.1		Homework 3 assigned Homework 3 key
Week 9	Mar. 1	Semantics of Datalog with Recursion and Negation	Ch. 9: Intro, 9.1 Francois Bancilhon, Raghu Ramakrishnan An Amateur’s Guide to Recursive Query Processing through Section 3.2.	Quiz 7 (rev) Lecture 4-1 Lecture 4-1 w/ink Lecture 4-2 Lecture 4-2 w/ink
					Homework 4 (final) assigned Homework 4 key
	Mar. 3				Homework 3 due
Week 10	Mar. 8	Evaluation and Application of Datalog	Badrish Chandramouli, Jonathan Goldstein, David Maier On-the-fly Progress Detection in Iterative Stream Queries	Quiz 8 Lecture 4-3 Lecture 4-2 w/ink Lecture 4-extra
Week 10	Mar. 10	Evaluation and Application of Datalog		Quiz 8 Lecture 4-3 Lecture 4-2 w/ink Lecture 4-extra	Homework 4 due
Finals Week	Tues. Mar. 15 10:15 – 12:05	Second EXAM Material from Feb. 3 to Mar. 10			Exam Info

Class E-mail

The e-mail list for this class is cs589@cs.pdx.edu. It will be used for announcements from the instructor. You can also send questions and answers to this mail list. You can subscribe to the list at https://mailhost.cecs.pdx.edu/mailman/listinfo/cs589. Please sign up with multiple e-mail addresses, if you use more than one e-mail address for your PSU class work. (This should make it easier for you to post message to the list from your various accounts.)

Catalog Description

This course covers the foundations of database systems, with a focus on data models and query languages. It will show how formal methods are applied to issues in database design and processing. Topics may include query formalisms and their equivalence, query transformation, semi-structured data models, dependencies and normal forms, logic and deductive databases, data language complexity, treatment of incomplete information, complex-value models, semantic models and classification, and temporal databases.

Prerequisite: CS 386 or equivalent

Textbooks

REQUIRED:
A Guided Tour of Relational Databases and Beyond. By Mark Levine and George Loizu, Springer, 1999, ISBN 1-85233-088-2.

NOTE:

You will be asked to read one section for the CS386/586 Textbook, Database Management Systems, 3rd Edition. By Raghu Ramakrishnan and Johannes Gehrke, McGraw Hill, 2000, ISBN 0-07-246563-8. You may already own the book or be able to borrow it from someone who has taken the class at PSU.

Reading

It is okay to do the reading after the lecture where the material is covered, but you should certainly complete it before the next week’s quiz.

Grading
Homework: There are 4 homework assignments, worth 40% of your grade (10% each). Assignments are given out on Thursdays and are due one week later. Homeworks can be done individually or in teams of two students. If you work in a team, then turn in one paper with the names of both team members on it. Make sure your homework is legible. You may seek help from your partner (if you have one), the instructors and the class mailing list, but otherwise work independently.
Quizzes: There are 8 quizzes, worth 10% of your grade. I drop your lowest quiz grade, so the quizzes are worth ~1.5% each. A quiz is given once a week; but there will be some weeks that don’t have a quiz. Each quiz covers material from the preceding week, including both lecture and reading material. There are NO MAKEUPS FOR QUIZZES. Quizzes will be closed book; you will NOT be able to use your book or any notes during the quizzes.

Exams: There is a first exam (25%) that covers the 1^st half of the class material, and a second exam (25%) during finals week that covers the 2^nd half of class material. You will be able to use the textbook and class notes during the exams.

Information

Policies

Students are responsible for anything that transpires during a class. Therefore if you're not able to attend class, you should get notes from someone else (not the instructor).

Homework is due at the beginning of the class period.

Late homework and projects will not be accepted without prior approval. Please submit your request to turn in homework late from both of the instructors. Lack of prior approval is an automatic 50% off, or 0% if that assignment has been discussed in class.

Requests for regrading must be submitted to both instructors in writing within one week of the time the graded assignment was made available for pickup. You must be specific in saying why you feel your answer deserves additional credit.

Makeup exams will not be given except in cases of severe medical, family, or other emergencies. If an emergency arises and you are going to miss an exam, contact both instructors BEFORE the exam to arrange for a special circumstance.

Students with disabilities who are in need of academic accommodations should contact me as soon as possible to arrange needed supports. Students are also encouraged to contact the Disability Resource Center (DRC) for additional information on support services and available accommodations at 503 725-4150.

Academic Integrity

Student Conduct

433 Smith Memorial Student Union

503-725-4422

conduct@pdx.edu

www.pdx.edu/dos/conduct.html

[Excerpt from the 2008-2009 PSU Catalog, page 29]

The policies of the University governing the rights, freedoms, responsibilities, and conduct of students are set forth in the Portland State University Code of Student Conduct and Responsibility, which has been issued by the president under authority of the Administrative Rules of the Oregon State Board of Higher Education. The code governing academic honesty is part of the Code of Student Conduct and Responsibility. Students may consult these documents in the Office of Student Affairs, 433 Smith Memorial Student Union or by visiting www.pdx.edu/dos/conduct.html. Observance of these rules, policies, and procedures helps the University to operate in a climate of free inquiry and expression and assists it in protecting its academic environment and educational purpose.

Academic honesty is a cornerstone of any meaningful education and a reflection of each student’s maturity and integrity. The Code of Student Conduct and Responsibility, which applies to all students, prohibits all forms of academic cheating, fraud, and dishonesty. These acts include, but are not limited to, plagiarism, buying and selling of course assignments and research papers, performing academic assignments (including tests and examinations) for other persons, unauthorized disclosure and receipt of academic information, and other practices commonly understood to be academically dishonest.

Winter 2011 CS 589 Principles of Database Systems

This Document is stored at http://www.cs.pdx.edu/~maier/cs589

Announcements (Last update 14 Mar 2011, 5:45P):

· Answer key to HW 4 posted

· Lecture 4-2 w/ ink posted

· Info on Test 2 posted

Weekly Schedule

[This schedule is preliminary and subject to change (especially the 2^nd half).]

The class is divided into four units, indicated by color: Unit 1 (yellow),
Unit 2 (blue), Unit 3 (pink), and Unit 4 (green).

Quizzes on (most) Tuesdays, HW Assignments due on Thursdays

Class E-mail

Catalog Description

Textbooks

Reading

Exams: There is a first exam (25%) that covers the 1^st half of the class material, and a second exam (25%) during finals week that covers the 2^nd half of class material. You will be able to use the textbook and class notes during the exams.

Information

Policies

Students are responsible for anything that transpires during a class. Therefore if you're not able to attend class, you should get notes from someone else (not the instructor).

Homework is due at the beginning of the class period.

Late homework and projects will not be accepted without prior approval. Please submit your request to turn in homework late from both of the instructors. Lack of prior approval is an automatic 50% off, or 0% if that assignment has been discussed in class.

Requests for regrading must be submitted to both instructors in writing within one week of the time the graded assignment was made available for pickup. You must be specific in saying why you feel your answer deserves additional credit.

Makeup exams will not be given except in cases of severe medical, family, or other emergencies. If an emergency arises and you are going to miss an exam, contact both instructors BEFORE the exam to arrange for a special circumstance.

Academic Integrity

Student Conduct

Supplementary Readings

The Theory of Relational Databases, David Maier, Computer Science Press, 1983.
(This book is out of print but we have a scanned version on line.)

Relational Database Theory, Paolo Atzeni and Valeria De Anotonellis, Benjamin Cummings, 1993.

Foundations of Databases, Serge Abiteboul, Richard Hull and Victor Vianu, Addison Wesley, 1995.

Database relations with null values, Carlo Zaniolo, SIGMOD, 1982. (Note, you need to be in the PSU domain to download papers from the ACM Portal.)

Winter 2011 CS 589 Principles of Database Systems

This Document is stored at http://www.cs.pdx.edu/~maier/cs589

Announcements (Last update 14 Mar 2011, 5:45P):

· Answer key to HW 4 posted

· Lecture 4-2 w/ ink posted

· Info on Test 2 posted

Weekly Schedule

[This schedule is preliminary and subject to change (especially the 2nd half).]

The class is divided into four units, indicated by color: Unit 1 (yellow), Unit 2 (blue), Unit 3 (pink), and Unit 4 (green).

Quizzes on (most) Tuesdays, HW Assignments due on Thursdays

Class E-mail

Catalog Description

Textbooks

Reading

Exams: There is a first exam (25%) that covers the 1st half of the class material, and a second exam (25%) during finals week that covers the 2nd half of class material. You will be able to use the textbook and class notes during the exams.

Information

Policies

Students are responsible for anything that transpires during a class. Therefore if you're not able to attend class, you should get notes from someone else (not the instructor).

Homework is due at the beginning of the class period.

Late homework and projects will not be accepted without prior approval. Please submit your request to turn in homework late from both of the instructors. Lack of prior approval is an automatic 50% off, or 0% if that assignment has been discussed in class.

Requests for regrading must be submitted to both instructors in writing within one week of the time the graded assignment was made available for pickup. You must be specific in saying why you feel your answer deserves additional credit.

Makeup exams will not be given except in cases of severe medical, family, or other emergencies. If an emergency arises and you are going to miss an exam, contact both instructors BEFORE the exam to arrange for a special circumstance.

Academic Integrity

Student Conduct

Supplementary Readings

The Theory of Relational Databases, David Maier, Computer Science Press, 1983. (This book is out of print but we have a scanned version on line.)

Relational Database Theory, Paolo Atzeni and Valeria De Anotonellis, Benjamin Cummings, 1993.

Foundations of Databases, Serge Abiteboul, Richard Hull and Victor Vianu, Addison Wesley, 1995.

Database relations with null values, Carlo Zaniolo, SIGMOD, 1982. (Note, you need to be in the PSU domain to download papers from the ACM Portal.)

[This schedule is preliminary and subject to change (especially the 2^nd half).]

The class is divided into four units, indicated by color: Unit 1 (yellow),
Unit 2 (blue), Unit 3 (pink), and Unit 4 (green).

Exams: There is a first exam (25%) that covers the 1^st half of the class material, and a second exam (25%) during finals week that covers the 2^nd half of class material. You will be able to use the textbook and class notes during the exams.

The Theory of Relational Databases, David Maier, Computer Science Press, 1983.
(This book is out of print but we have a scanned version on line.)