CS145 - Spring 2002
Introduction to Databases
- The final exam will be held on Wednesday June 12 from 9:30-11:30
AM. It will be two hours long beginning at 9:30 AM, not three hours
long beginning at 8:30 AM as scheduled by the university. The exam
will be held in the Cubberly Auditorium, School
of Education, 485 Lasuen Mall. All students, including SCPD
students, are expected to attend the exam on-campus. There will be no
early or makeup exams.
- The exam will be closed book. However, each student may bring up
to three pages of prepared notes. That's six total sides of writing
on 8-1/2"x11" paper.
- A sample final exam (from Prof. Widom's Spring '01 offering
of CS145) is linked to the Exams page.
- A sample solution for Written Assignment #8 will be linked to
the Assignments page no later than
noon on Friday June 7.
- SCPD Students: Please be sure to bring a route slip
with you to the exam. If you do not bring a route slip, we will not
be able to send your graded exam back by courier.
For your convenience, two alternative review sessions will be
conducted by the TA's:
- Monday June 10 from 7:30-9:00 PM in Building 380 Room 380C
- Tuesday June 11 from 4:00-5:30 PM in Building 380 Room 380C
Please bring questions. The review sessions will not be televised.
The final exam will cover all material covered by the midterm exam
(see Midterm
Logistics and Review). In addition, the following material
will be covered:
- All lectures through Wednesday June 5
- All required readings from the Course Schedule
- Assignments #4-8
A few things to note:
- Although all material from the entire course is eligible to
appear on the final exam, the exam will be weighted heavily toward
the material from the latter half of the course.
- The material on entity-relationship diagrams, although not
included on this review page since it was covered just before the
midterm, is considered part of the latter half of the course for exam
purposes.
- As on the midterm exam, solutions on the final exam
will be graded for simplicity and clarity as well as for correctness.
What follows is an outline of the material we've covered since the
midterm exam. All of this material is fair game for the final exam.
- Object-oriented design
- ODL: classes, attributes, relationships, keys
- Set and inverse relationships
- Subclasses
- Translating E/R and ODL to relations
- Semiautomatic translation algorithms
- Transactions
- Motivation: multi-user, crash recovery
- ACID properties
- Serializability
- Transaction rollback
- Isolation levels: read uncommitted, read committed, repeatable read, serializable
- Locking protocols (brief)
- Authorization
- Privileges
- Views and authorization
- grant and revoke statements
- Constraints and triggers
- Non-null constraints
- Key constraints
- Referential integrity
- Attribute-based constraints
- Tuple-based constraints
- General assertions
- SQL3 triggers
- Recursion
- WITH statement including WITH RECURSIVE
- Mutual recursion
- Object-relational SQL
- Nested structures using TYPEs (UDTs)
- Methods
- References
- Ordering relationships
- Temporal databases
- Temporal relational model
- Temporal relational algebra
- Data warehousing and mining
- OLTP vs. OLAP
- Data warehousing architecture
- Star schemas
- Data cubes
- Association rules, support & confidence
- XSLT
- Document tree model
- Structural recursion
- XSLT directives and processing model
- XML Schema (very cursory)