1. Final Review Datalog (Ch 10) Rules and queries
RA expressions for Datalog rules
Datalog program as a query expression and rectification
Concept of Safety
Negation combined with Recursion
Safe and Stratified Rules
Fixed Point Solution for recursive and non-recursive datalog programs

2. Index Structures (Ch. 13) Conventional Indexes B+ Tree Hash Tables
Dense, Sparse, Multiple levels, Secondary
B+ Tree
Hash Tables
Extensible and Linear

3. Logging (Ch. 17)
Basics of UNDO and REDO logging, checkpointing, recovery

4. Concurrency Control (Ch. 18)
Serializability, schedules, transactions,
Conflict Serializability
Precedence graphs
Lock-based protocols, Two-phase locking
Tree protocol
Timestamp-based protocol

5. More about TM (Ch. 19)
Dirty data problem, cascading rollback, recoverable schedules
Resolving deadlocks, timeouts, the Waits-for graph, locks by ordering elements, timestamps

6. The Query Compiler (Ch. 16)
Algebraic laws
Estimating sizes of intermediate relations
Projection, Selection, and Join

7. Query Execution (Ch. 15) Nested-loop joins Sort-based joins
Index-based Selection
Index-based Join