CS145 - Spring 2003
Introduction to Databases
- The final exam will be held on Friday June 6 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 our usual classroom, the Gates Building Room B01 (the
Hewlett-Packard Auditorium). 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 '02 offering
of CS145) is linked to the Exams page.
Note there were a number of differences in topics covered.
- Sample solutions for OTC Exercises 5 and Challenge Problems 5
will be linked to the Assigned Work
page on Wednesday June 4.
- SCPD Students: Please be sure to bring a route form
with you to the exam. If you do not bring a route form, we will not
be able to send your graded exam back by courier.
A review session will be conducted by two of the TA's on Thursday May
5 from 4:00-5:30 PM in Terman 156, the usual help session room.
Please bring questions. The review session will be televised live on
Channel E1.
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 4
- All required readings from the Course Schedule
- OTC Exercises #4,5
- Challenge Problems #4,5
- The AuctionBase programming project
Please 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.
- 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.
- UML
- Classes
- Associations, multiplicities, self-associations
- Association classes
- Subclasses
- Aggregation and composition
- Translating UML designs to relational schemas
- Constraints and triggers
- Non-null constraints
- Key constraints
- Referential integrity
- Attribute-based constraints
- Tuple-based constraints
- General assertions
- SQL3 triggers
- Transactions
- Motivation: multi-user, crash recovery
- ACID properties
- Serializability
- Transaction rollback
- Isolation levels: read uncommitted, read committed, repeatable read, serializable
- Indexes
- Properties and uses of indexes
- Index selection
- Creating indexes in SQL
- Views
- Creating and using views
- Modifying views
- Materialized views
- Authorization
- Privileges
- Views and authorization
- grant and revoke statements
- Object-relational SQL
- Nested structures using TYPEs (UDTs)
- Methods
- References
- Ordering relationships
- Recursion
- WITH statement including WITH RECURSIVE
- Linear and nonlinear recursion
- Mutual recursion
- 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
- Data stream processing
- Differences between DBMS and DSMS
- Continuous query language (CQL)
- Implementation issues