Spring 2006 CS 386 Introduction to Databases
Announcements
(Last update 9 June, 1:10PM):
·
HW 6 & 7 solutions online.
·
Quiz 8
solutions online.
·
Sample
exam posted.
·
Final exam, 10:15-12:05, MONDAY, 12 June.
|
Instructor
|
David Maier maier
at cs dot pdx dot edu, 310-05 FAB. Note: When sending email to me directly, please
put ‘cs386’ at the beginning of the subject line.
|
|
Class Meeting
|
Tuesday,
Thursday 2:00-3:50 PM , SH 145
|
|
Office Hours
|
Mondays
2:00-3:00 PM (I
will stay as long as students are there, except the first Monday of the
month.)
|
|
TA
|
Nick
Rayner, raynern at cecs dot pdx dot edu
|
|
TA Offices Hours
|
Wednesday
4:00-6:00 PM; Thursday 12:30-1:30 PM, in the Fishbowl near the CS office
(FAB)
|
Weekly Schedule
[This schedule is preliminary and subject to change]
Quizzes on Tuesdays, Assignments due Thursdays
|
Wk
|
Date
|
Topic
|
Reading Assgt
|
Slides; Quizzes (Tuesdays)
|
Due (Thursdays)
|
|
1
|
April 4,6
|
Intro. to relational
databases; SQL
|
Ch. 1;
Ch. 3: Intro, 3.1-3.4;
Ch. 5: Intro, 5.1, 5.2
|
Lecture 1
|
|
|
2
|
April
11,13
|
Relational Algebra
and Complex SQL
|
Ch. 5: 5.3-5.6;
Ch. 4: Intro, 4.1, 4.2
|
Lecture 2
Quiz 1
|
Homework 1
HW 1
solutions
|
|
3
|
April
18,20
|
Relational Algebra and Complex SQL (cont.)
Constraints & Triggers
|
Ch. 5: 5.7-5.9
|
Lecture 3
Quiz 2
Use Case Example
|
Homework 2
HW 2
solutions
|
|
4
|
April 25,27
|
Views
Use Cases
|
Ch 3: 3.6-3.7
|
Lecture 4
Quiz 3
|
Homework 3
rev3
HW 3
solutions
|
|
5
|
May
2,4
|
Database Design
Embedded SQL
|
Ch 2: Intro, 2.1-2.9 (not
2.4.4, 2.4.5, 2.5.4)
Ch. 3: 3.5 (not
3.5.6, 3.5.7)
|
Lecture 5
Quiz 4
|
Homework 4
HW 4
solutions
|
|
6
|
May
9
|
Tuesday May 9: First EXAM on
all preceding material
|
|
|
|
May 11
|
PHP
|
Ch. 7
|
Lecture
6
Lecture
6a
|
|
|
7
|
May
16,18
|
Storage and Indexing, Disks and Files, Query Evaluation
|
Sec. 9.1;
Ch. 8: Secs
8.1-8.3, 8.5, 8.6;
Ch 12
|
Lecture 7
Quiz 5
|
Homework 5
(initial hand in)
|
|
8
|
May
23,25
|
Query Optimization
Transactions
|
Sec. 14.4, Sec. 15.3
Ch 16
|
Lecture 8
Quiz 6
|
Homework
5
(final hand in)
|
|
9
|
May 30, June 1
|
Schema Refinement
Normalization
|
Ch. 19 (not
19.8)
|
Lecture 9
Class
Exercise 1
Update of Lect. 9
Quiz 7
|
Homework 6
HW 6
solutions
|
|
10
|
June
6,8
|
Physical Database Design and Tuning; Security
|
Ch 20: 20.1-20.3, 20.6-20.9;
Ch 21: 21.1-21.3
|
Lecture
10
Quiz
8
|
Homework 7
rev 2
HW 7
solutions
|
|
|
Monday
June 12
|
Second EXAM at final exam time
(10:15-12:05), on material since First EXAM
|
Sample Exam
|
Class E-mail
I hope the e-mail
list for this class will be cs386@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://webmail.cecs.pdx.edu/mailman/listinfo.cgi/cs386.
Catalog Description
Introduction to
fundamental concepts of database management with the relational model. Schema
design and refinement, query languages, transaction management, security,
database application environments, physical data organization, overview of
query processing, physical design tuning. Prerequisites: CS 163, 250, 251.
Textbooks
REQUIRED:
Database Management Systems,
3rd Edition. By Raghu Ramakrishnan and Johannes Gehrke,
McGraw Hill, 2000, ISBN 0-07-246563-8.
SUGGESTED:
Since you will be using SQL in
a number of assignments, you may wish to have additional information concerning
the SQL query language. SQL: 1999 -- Understanding Relational Language
Components, by Melton, Simon, and Gray (2001, ISBN 1-55860-456-1) is a
good reference.
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 7 homeworks, each worth
4%, except HW 5 is worth 5%. So homeworks are 29% of
your grade. 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 all team members on it. Assignments are given out on
THURSDAY and are due the following THURSDAY (except HW 5). Make sure your
homework is legible. You may seek help from the instructor and the TA (and your
partner, if you have one), but otherwise work independently.
Quizzes: There are 8 quizzes, each worth 3%, but I drop your lowest quiz grade, so the
quizzes are worth 21% of your grade. A quiz is given on most TUESDAYs. 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.
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. Exams will be
open book and notes.
Information
Database
Support Page (general information about DBMS products and data files) , answers
to odd numbered questions, the SQL-92 Standard, symbols for Word and symbols for Power
Point.
Policies
Students are responsible for anything that transpires during a class -
therefore if you're not in a class, you should get notes from someone else (not
the instructor).
Homeworks are due at the beginning of
the class period.
Late homework will not be accepted without prior
approval from me.
Requests for regrading must
be submitted to me 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 or family emergencies. If an emergency arises and you are going
to miss an exam, contact me 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-4240 or 503 725-4150.
Academic Integrity
[Excerpt from
the 2004-2005 PSU Catalog, pages 29-30]
The policies of the University governing the rights, freedoms,
responsibilities, and conduct of students are set forth in the Statement of
Student Rights, Freedoms, and Responsibilities, as supplemented and amended by
the Portland State University Student
Conduct Code, 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 Student Conduct Code. Students may
consult these documents in the Office of Student Affairs, 433 Smith Memorial
Student Union or by visiting the OSA Web site. 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: Academic honesty is a cornerstone of any meaningful education
and a reflection of each student’s maturity and integrity. The Office of
Student Affairs is responsible for working with University faculty to address
complaints of academic dishonesty. The Student Conduct Code, 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. For a copy of
the Student Code of Conduct see the OSA Web site. Allegations of academic
dishonesty may be addressed by the instructor, may be referred to the Office of
Student Affairs for action, or both. Allegations referred to the Office of
Student Affairs are investigated following the procedures outlined in the
Student Conduct Code. Acts of academic dishonesty may result in one or
more of the following sanctions: a failing grade on the exam or assignment for
which the dishonesty occurred, disciplinary reprimand, disciplinary probation,
loss of privileges, required community service, suspension from the University
for a period of up to two years, and/or dismissal from the University.
Questions regarding academic honesty should be directed to the Office of
Student Affairs, 433 Smith Memorial Student Union.
Supplementary Readings
What follows is a
list of online resources that you may find helpful over the course of the
class. None of these materials are necessary to complete the class; however,
you may find that they can offer you perspectives beyond those offered by the
textbook or the instructor/TA, especially if you plan to continue your study in
the database field.
Relational
model
- E. F. Codd. A relational model of data for large shared
databanks. Communications of the ACM, 13(6):377-387, 1970. (.pdf) (.html )
- E. F. Codd. Data
models in database management. In Proc. ACM SIGMOD/PODS Workshop on
Data Abstraction, Databases, and Conceptual Modeling, pp. 112-114,
1980.
- William Kent. Limitations of
record-based information models. ACM Transactions on Database
Systems, 4(1):107-131, 1979.
- Joseph Albert. Algebraic
Properties of Bag Data Types, In Proc. 17th International VLDB
Conference, Barcelona,
Sept. 1991.
- Carlo Zaniolo. Database
Relations with Null Values (Extended Abstract). In proc. PODS,
1982: 27-33.
Conceptual
and Logical Design
Storage
and indexing
Query
processing
- D. Chamberlin, et al.
A history and
evaluation of System R. Communications of the ACM,
24(10):632-646, 1981.
- Yannis Ioannidis. Query optimization.
Handbook for Computer Science, Chapter 45 (CRC Press).
- Goetz Graefe. Query
evaluation techniques for large databases. ACM Computing Surveys
25(2): 73-170. 1993.
- M.W. Blasgen, et al. System R: An
architectural overview. IBM Systems Journal, 20(1):375-396,
1981.
- P. Griffiths Selinger et al, Access path
selection in a relational database management system. ACM SIGMOD
international conference on Management of data, pp. 23-34, 1979.
Transactions
Others