Physical DB Design
File organizations: heapfile, sorted file, hashed file
Disks: speed and physical characteristics
Buffer pool can vary in size; frame holds page
Replacement policy choice is important
Indexes can speed up data access:
- Clustered vs. unclustered
- Primary vs. secondary
- Dense vs. sparse
- B+ Trees are the most common: log(N) searches