Physical Implementation of Database Systems

1. Hardware: CPU, CPU caches, memory
2. Hardware: disk, sequential vs random accessing
3. Paged data structures: array, hash table
4. Paged data structures: B-tree, R-tree
5. Main-memory data structures vs paged data structures
6. Bulk-loading data vs insert-by-insert
7. Concurency and data structures
8. Concurency and data structures II
9. Concurency control
10. Concurency control II
11. Concurency control III
12. Transaction Processing
13. Transaction Processing II

Practices:
1. Implementation of the cache buffer.
2. Implementation of the cache buffer.
3. Implementation of a paged data structure (B-tree, hash table, array, R-tree, bitmap index).
4. Implementation of a paged data structure: insert.
5. Implementation of a paged data structure: find.
6. Implementation of a paged data structure: range query.
7. Implementation of a paged data structure: bulk load insert.
8. Performance testing.
9. Implementation of a shared cache buffer, page locking.
10. Query parallelization.
11. Query parallelization: testing.
12. Implementation of a log file and recovery.
13. Implementation of a log file and recovery.