Lesson plans

Historical manuscript reference. Numbering, prerequisite claims, and verification below describe the original eight-module import. For the current ten-stage path and teaching-review status, use the learning path and course outline.

Editorial teaching plans accompany each complete chapter. They define the progression and required explanatory material; they are not learner assignments.

• 01. Workloads and correctness contracts
• 02. Hardware and operating-system costs
• 03. Local concurrency and execution
• 04. Networking and transport
• 05. Application protocols and remote calls
• 06. Performance reasoning
• 07. Logical models and schemas
• 08. Physical representation
• 09. Memory and buffer management
• 10. Tree and hash indexes
• 11. Log-structured storage
• 12. Specialized access paths
• 13. Query front end
• 14. Logical optimization
• 15. Physical operators
• 16. Cost-based planning
• 17. Execution engines
• 18. Computation boundaries
• 19. Atomic transactions and logging
• 20. Lock-based concurrency control
• 21. Multiversion concurrency control
• 22. Alternative execution strategies
• 23. Concurrent engine internals
• 24. Crash recovery and durable commit
• 25. Distributed failure models
• 26. Distributed consistency
• 27. Replication strategies
• 28. Consensus and leadership
• 29. Partitioning and routing
• 30. Distributed transactions
• 31. Distributed query execution
• 32. Caches and maintained results
• 33. Realtime delivery
• 34. Tail latency and overload
• 35. Capacity and multitenancy
• 36. Separated compute and storage
• 37. Application data architecture
• 38. Geographic architecture
• 39. Failure recovery and continuity
• 40. Security and isolation
• 41. Safe evolution
• 42. Observability and verification
• 43. SQLite and PostgreSQL
• 44. RocksDB and Cassandra
• 45. Redis and memory-oriented designs
• 46. Spanner, CockroachDB, and FoundationDB
• 47. Contrasting workload priorities
• 48. A complete architecture walkthrough