|
Instructors |
David Maier maier at cs dot pdx dot edu, 115-14 FAB. Lois Delcambre lmd at cs dot pdx dot edu, 115-12 FAB. Note: Please put ‘cs589’ at the beginning of the subject line. |
|
Phone: |
Lois: 503 725-2405 Dave: 503 725-2406 |
|
Class Meeting |
Monday/Wednesday 17:15-18:30, FAB 150 |
|
Office Hours |
Dave: TBA Lois: TBA You are welcome to ask questions by e-mail or phone. |
|
Guest Lecturer |
Dave Archer |
|
Week |
Date |
Topic |
|
Slides; Quizzes (Mondays) |
Due except #4 which is due on Monday) |
|
Week 1 |
Sept 29 DA |
Introduction: Background, Set Theory, Relational Algebra; |
Ch. 1: Intro, 1.1-1.8, 1.9.1; |
|
|
|
Oct. 1 DA |
Domain Relational Calculus |
Section 4.3 from Ramakrishnan and Gehrke (the CS 386/586 textbook); Ch. 3: Intro, 3.1, 3.2.1, 3.2.2; |
Homework 1 assigned |
||
|
Week 2 |
Oct. 6/8 |
Dependencies and Inference |
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 1 |
|
|
Homework 1 due |
|||||
|
Week 3 |
Oct 13/15 DM |
Dependencies and Inference, Null values |
Ch. 5: 5.1-5.4, 5.5 (first few pages). |
||
|
Homework 2 assigned |
|||||
|
Week 4 |
Oct 20 DM |
Normal Forms, Synthesis Algorithm
|
Ch. 3: 3.6.5, 3.6.6, Ch. 4: 4.1 (review), 4.2, 4.3, 4.4 (through BCNF), 4.6.1 |
|
|
|
Oct 22 DM |
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.] |
Homework 2 due |
||
|
Week 5 |
Oct 27 DM |
Algebraic Equivalences and Optimization (cont.) |
|
||
|
Oct 29 |
FIRST EXAM |
Material from |
|||
|
Week 6 |
Nov 3/5 DM |
Algebraic Equivalences and Optimization (cont.) |
Cesar Galindo-Legaria, Milind Joshi Orthogonal Optimization of Subqueries and Aggregation |
|
|
|
Homework 3 |
|||||
|
Week 7 |
Nov 10/12 LMD |
Intro to Datalog ;
Domain |
Ch. 3: 3.2.3;
|
||
|
Homework 3 due |
|||||
|
Week 8 |
Nov 17/19 LMD |
Equivalence of Relational Query Languages; |
Ch. 3: 3.3; |
|
|
|
Homework 4 assigned |
|||||
|
Week 9 |
Nov 24 LMD |
Semantics of Datalog with Recursion and Negation (cont.) |
Ch. 9: Intro, 9.1 |
||
|
Nov 26 |
NO CLASS! Happy Thanksgiving! |
||||
|
Week 10 |
Dec 1/3 |
Models and Interpretations in Logic |
Ch. 1: 1.9.3 |
Homework 4 Due NOTE: DUE ON MONDAY! |
|
|
Finals Week |
Monday Dec 8 17:30-19:20 |
Second EXAM Material from Oct 22 – Dec 1 |
|
||
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.)
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
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.
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.
433 Smith Memorial Student Union
503-725-4422
conduct@pdx.edu
[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.