CHAP 2
Relational semantics
Relational algebra
	selection, projection, predicate
	Translation to SQL

CHAP 3, 4, 5
SQL
Scalar vs aggregate functions


CHAP 7
E/R diagrams
inheritance
aggregation
weak entity sets
relationships
	cardinality
reduction to relation schemas


CHAP 8 CHEAT SHEET
Armstrong's Axioms & Extensions
	Identify them by name
Closure of F
Closure of attributes
Canonical cover
3NF 
BCNF
Lossless joins
Dependency preserving
Find candidate keys


CHAP 10 Storage				
Storage heirarchy
	Characteristics of each layer in the hierarchy
		Examples of each kind
	Characteristics of volatile storage?
	Characteristics of nonvolatile storage?
	Characteristics of stable storage?


*	File Organization 
		Ordered /  Unordered	/ Hash / Clustered
		How are records stored physically on disk
		Algorithms for inserting / deleting
	
*	Record organization
		fixed length records
			insertion / deletion algorithms
		variable length records
			slotted page record structure


RAID
	2 levels that are used and why 

MTF
	Basic calculation


clustering

CHAP 11 Indexing and Hashing

B+ TREES
clustered index 
*	What is a root node ?
*	What is a leaf node ?
*	What is an internal node ?
*	Each node contains
		how many key values
		how many pointers
			why ?
RULES
*	For each node
*	For the root

HASHING
	index
	file
	2 characteristics of a good hash function

CHAP 12 - Query Processing
Anatomy of a hard drive
	platter, sector, track, block, read / write head
seek
rotational latency
access time
transfer time

Formulas for join algorithms
	Only need to know how to use them

CHAP 14 Transactions

ACID - definitions

Transaction state
	5 of them
	What actions put a transaction into a terminated state?

Schedule
	definition
Serializable
Conflict Serializable
Recoverable Schedule 
Cascadeless Schedules