Courses
CS 460: Database Systems
| Objective |
- Functions of a database system.
|
| Pre-Conditions |
- [CS344] Predicate calculus, including wffs, free
and bound variables
- [Math243] Set theory, at a basic level
- [CS330] Knowledge of modular design of large
systems (>5000 lines)
- [CS342] Hashing
- [CS127b/CS227] Simple
tree data structures
- [CS342] Asymptotic complexity analysis
- [CS127b/CS227] Abstract
data types
- [CS342] Sorting and searching algorithms
- [Math243] Comfort in writing elementary proofs, including proof by
contradiction and proof by induction
|
Post-Conditions
(Topics) |
- [2 lectures] Functions of a Data Base System
- [6 lectures] Conceptual Design. Overview of database design. E-R
model.
- [7 lectures] Relational Model. Relational schemas. Relational algebra and
calculus.
- [7 lectures] SQL
- [5 lectures] Logical Database Design. Functional dependencies.
Normalization.
- [4 lectures] Physical Design. Indexing. Hashing. B-trees. Multiple-key
access.
- [3 lectures] Query Evaluation. Algebraic simplification. Optimizer
structure. Algebraic operators.
- [7 lectures] Crash Recovery and Concurrency Control. Transactions. Logging.
Buffer Management. Locking. Serializability. Timestamp Ordering.
|
Authored by Rick Snodgrass
Last revised on 29 April 1997 by John Hartman.