Database Resiliency
summary
Explains concrete tradeoffs of the CAP theorem (favor consistency or availability under partition), compares specific topologies — master‑slave for read consistency, master‑master active‑active (Netflix style) with conflict resolution, and group replication / Galera using WSREP for synchronous commits and automatic node ejection; minimum quorum starts at three and clusters use odd counts (5,7,9,11). Details schema‑change paths (TOI, RSU, NBO), recommends automation with Flyway and LiquidBase, and shows automated backups, health checks and observability that actually prevent outages.
AI-written summary · about
chapters (16)
- 0:00Intro
- 0:15Database Resiliency for Mission Critical Computing
- 1:19CAP Theorem for Databases
- 2:30Principles De High Availability
- 5:21High Availability Architectures
- 6:11Master-Slave
- 11:14Master Master Replication
- 14:43Group Replication
- 21:52Galera Replication
- 27:57Operational Resilience
- 29:36TOI, Rolling Schema Upgrades vs NBO
- 34:20Schema Changes Automation
- 37:21Compatible & Non-Compatible Schema Changes
- 41:09Data Backup Strategy Best Practices
- 42:24Health & Readiness Checks
- 44:48Database Observability Engineering
related talks
41mEverything you always wanted to know about highly available distributed databases
57mScaling the CAP Theorem for Modern Distributed Systems
28mTobias Petry :: Scaling Databases
57mLiving in eventually consistent reality
53mGalera Cluster Data Consistency
52mThe Computer Science behind a modern distributed data store
24mComparing the High Availability of MySQL with Modern Distributed SQL Databases
24mDatabases beyond the tutorials