CS 457/557 Home page
Course Outline
Review
There
are 2 editions of the textbook, I will be providing page references
to exercises for the 2^{nd}. Generally, the second edition is condensed
from the first, new material added, and updated to reflect
larger, faster hardware as a result of "Moore's Law."
Assignments  due on Fridays in 2018
2016 ones are subject to change
 19 January Moore's law and disk capacity
 26 January RAID  Record and block layout
 2 February Variable Length Records, B+ Trees, and Hashing
 Algorithms, due 10 Feb
2018
 Algorithms 2, due 16
Feb. 2016
 Algorithms 3, Hashing, due 23
Feb. 2018
 Query plans, due 13
March 2018

Size estimation and physical query plans, due 20 March 2018
 Logging and isolation,
due April 9, 2018
Winter 2018 class.
(old assignments)
 RAID 5 & BLOB, Blocks
of Records, due Friday 28 September
 Indexes, Excercises 13.2.6 (a)
& (b), 13.3.5 (a,b,c, f,g,h), Due Friday 5 October
 Done. Observe plan selection in
PostgreSQL in the lab
 Parse and optimize logical query plans
 Physical Query plans, due
Wednesday 14 November
 Transactions:
Locking, Timestamp serialization

Below here is
even older stuff
Algorithms: Assign 4 and Lab
1, explain some queries
 Query plans Excercises
16.4.1 (a), (c), (d), (f)  use Y instead of Z, (h)
16.6.3: Greedy algorithm for the join of W X Y Z of 16.4.1(a)
and the 'tiebreaking modification of this excercise (a) of
T(T)=200 and V(T,d) = 150
16.7.1 (b), (c)
Due Monday 27 March
 Recovery from log, due Monday
3 April
 Concurrency control using
timestamps, validation. Due Monday 10 April.
Timestamping: Ex. 18.8.1 (b, (c), 18.8.2 (b),(c)
(Multiversiononly)  p. 980
Validation: Ex. 18.9.1 (b),(c),(d)  p. 985. Do any validations
fail?
Lin
Jensen