Designing Data-Intensive Applications chapters
About this audiobook · Recording details
Recording benjamin-lange-2021 · Narrated by Benjamin Lange
Showing 100 of 467 chapters
| Chapter | Title | Start | Duration |
|---|---|---|---|
| 201 | Serializability | 9:04:49.763 | 0:02:51.467 |
| 202 | Actual Serial Execution | 9:07:41.230 | 0:02:07.695 |
| 203 | Encapsulating Transactions in Stored Procedures | 9:09:48.925 | 0:02:50.562 |
| 204 | Pros and Cons of Stored Procedures | 9:12:39.487 | 0:02:35.166 |
| 205 | Partitioning | 9:15:14.653 | 0:02:00.752 |
| 206 | Summary of Serial Execution | 9:17:15.405 | 0:00:59.772 |
| 207 | Two-Phase Locking (2PL) | 9:18:15.177 | 0:02:18.563 |
| 208 | Implementation of Two-Phase Locking | 9:20:33.740 | 0:02:06.185 |
| 209 | Performance of Two-Phase Locking | 9:22:39.925 | 0:02:03.167 |
| 210 | Predicate Locks | 9:24:43.092 | 0:02:22.487 |
| 211 | Index-Range Locks | 9:27:05.579 | 0:02:49.656 |
| 212 | Serializable Snapshot Isolation (SSI) | 9:29:55.235 | 0:01:32.073 |
| 213 | Pessimistic Versus Optimistic Concurrency Control | 9:31:27.308 | 0:03:00.826 |
| 214 | Decisions Based on an Outdated Premise | 9:34:28.134 | 0:01:52.903 |
| 215 | Detecting Stale MVCC Reads | 9:36:21.037 | 0:01:29.054 |
| 216 | Detecting Writes That Affect Prior Reads | 9:37:50.091 | 0:01:59.545 |
| 217 | Performance of Serializable Snapshot Isolation | 9:39:49.636 | 0:02:21.883 |
| 218 | Summary | 9:42:11.519 | 0:05:07.847 |
| 219 | 8. The Trouble with Distributed Systems | 9:47:19.366 | 0:02:28.682 |
| 220 | Faults and Partial Failures | 9:49:48.048 | 0:03:36.130 |
| 221 | Cloud Computing and Supercomputing | 9:53:24.178 | 0:07:38.068 |
| 222 | Unreliable Networks | 10:01:02.246 | 0:03:17.949 |
| 223 | Network Faults in Practice | 10:04:20.195 | 0:03:28.799 |
| 224 | Detecting Faults | 10:07:48.994 | 0:03:04.166 |
| 225 | Timeouts and Unbounded Delays | 10:10:53.160 | 0:03:03.873 |
| 226 | Network Congestion and Queueing | 10:13:57.033 | 0:05:17.011 |
| 227 | Synchronous Versus Asynchronous Networks | 10:19:14.044 | 0:01:58.769 |
| 228 | Can We Not Simply Make Network Delays Predictable? | 10:21:12.813 | 0:06:13.610 |
| 229 | Unreliable Clocks | 10:27:26.423 | 0:02:10.206 |
| 230 | Monotonic Versus Time-of-Day Clocks | 10:29:36.629 | 0:00:21.408 |
| 231 | Time-of-Day Clocks | 10:29:58.037 | 0:01:33.549 |
| 232 | Monotonic Clocks | 10:31:31.586 | 0:02:27.802 |
| 233 | Clock Synchronization and Accuracy | 10:33:59.388 | 0:04:58.536 |
| 234 | Relying on Synchronized Clocks | 10:38:57.924 | 0:02:00.529 |
| 235 | Timestamps for Ordering Events | 10:40:58.453 | 0:05:12.319 |
| 236 | Clock Readings Have a Confidence Interval | 10:46:10.772 | 0:02:50.676 |
| 237 | Synchronized Clocks for Global Snapshots | 10:49:01.448 | 0:03:24.107 |
| 238 | Process Pauses | 10:52:25.555 | 0:08:08.274 |
| 239 | Response Time Guarantees | 11:00:33.829 | 0:03:07.684 |
| 240 | Limiting the Impact of Garbage Collection | 11:03:41.513 | 0:01:37.362 |
| 241 | Knowledge, Truth, and Lies | 11:05:18.875 | 0:02:22.816 |
| 242 | The Truth Is Defined by the Majority | 11:07:41.691 | 0:03:40.530 |
| 243 | The Leader and the Lock | 11:11:22.221 | 0:02:27.802 |
| 244 | Fencing Tokens | 11:13:50.023 | 0:02:42.464 |
| 245 | Byzantine Faults | 11:16:32.487 | 0:06:35.311 |
| 246 | Weak Forms of Lying | 11:23:07.798 | 0:02:00.822 |
| 247 | System Model and Reality | 11:25:08.620 | 0:03:46.982 |
| 248 | Correctness of an Algorithm | 11:28:55.602 | 0:01:36.188 |
| 249 | Safety and Liveness | 11:30:31.790 | 0:02:48.037 |
| 250 | Mapping System Models to the Real World | 11:33:19.827 | 0:02:55.661 |
| 251 | Summary | 11:36:15.488 | 0:05:04.941 |
| 252 | 9. Consistency and Consensus | 11:41:20.429 | 0:04:14.664 |
| 253 | Consistency Guarantees | 11:45:35.093 | 0:04:06.424 |
| 254 | Linearizability | 11:49:41.517 | 0:02:51.898 |
| 255 | What Makes a System Linearizable? | 11:52:33.415 | 0:09:37.487 |
| 256 | Relying on Linearizability | 12:02:10.902 | 0:00:26.965 |
| 257 | Locking and Leader Election | 12:02:37.867 | 0:01:39.618 |
| 258 | Constraints and Uniqueness Guarantees | 12:04:17.485 | 0:02:03.213 |
| 259 | Cross-Channel Timing Dependencies | 12:06:20.698 | 0:03:04.256 |
| 260 | Implementing Linearizable Systems | 12:09:24.954 | 0:04:00.807 |
| 261 | Linearizability and Quorums | 12:13:25.761 | 0:02:29.053 |
| 262 | The Cost of Linearizability | 12:15:54.814 | 0:02:04.336 |
| 263 | The CAP Theorem | 12:17:59.150 | 0:04:21.030 |
| 264 | Linearizability and Network Delays | 12:22:20.180 | 0:02:50.026 |
| 265 | Ordering Guarantees | 12:25:10.206 | 0:01:50.104 |
| 266 | Ordering and Causality | 12:27:00.310 | 0:04:35.636 |
| 267 | The Causal Order Is Not a Total Order | 12:31:35.946 | 0:03:23.731 |
| 268 | Linearizability Is Stronger Than Causal Consistency | 12:34:59.677 | 0:02:29.053 |
| 269 | Capturing Causal Dependencies | 12:37:28.730 | 0:02:32.799 |
| 270 | Sequence Number Ordering | 12:40:01.529 | 0:02:22.686 |
| 271 | Noncausal Sequence Number Generators | 12:42:24.215 | 0:03:25.978 |
| 272 | Lamport Timestamps | 12:45:50.193 | 0:02:45.157 |
| 273 | Timestamp Ordering Is Not Sufficient | 12:48:35.350 | 0:03:01.261 |
| 274 | Total Order Broadcast | 12:51:36.611 | 0:02:32.002 |
| 275 | Using Total Order Broadcast | 12:54:08.613 | 0:02:23.604 |
| 276 | Implementing Linearizable Storage Using Total Order Broadcast | 12:56:32.217 | 0:04:16.869 |
| 277 | Implementing Total Order Broadcast Using Linearizable Storage | 13:00:49.086 | 0:02:38.570 |
| 278 | Distributed Transactions and Consensus | 13:03:27.656 | 0:04:23.342 |
| 279 | Atomic Commit and Two-Phase Commit (2PC) | 13:07:50.998 | 0:01:13.622 |
| 280 | From Single-Node to Distributed Atomic Commit | 13:09:04.620 | 0:03:56.243 |
| 281 | Introduction to Two-Phase Commit | 13:13:00.863 | 0:03:03.242 |
| 282 | A System of Promises | 13:16:04.105 | 0:04:22.532 |
| 283 | Coordinator Failure | 13:20:26.637 | 0:02:29.671 |
| 284 | Three-Phase Commit | 13:22:56.308 | 0:01:18.072 |
| 285 | Distributed Transactions in Practice | 13:24:14.380 | 0:02:51.111 |
| 286 | Exactly-Once Message Processing | 13:27:05.491 | 0:01:54.883 |
| 287 | XA Transactions | 13:29:00.374 | 0:03:06.483 |
| 288 | Holding Locks While in Doubt | 13:32:06.857 | 0:01:34.657 |
| 289 | Recovering from Coordinator Failure | 13:33:41.514 | 0:02:08.232 |
| 290 | Limitations of Distributed Transactions | 13:35:49.746 | 0:03:06.887 |
| 291 | Fault-Tolerant Consensus | 13:38:56.633 | 0:05:01.771 |
| 292 | Consensus Algorithms and Total Order Broadcast | 13:43:58.404 | 0:02:13.895 |
| 293 | Single-Leader Replication and Consensus | 13:46:12.299 | 0:02:06.614 |
| 294 | Epoch Numbering and Quorums | 13:48:18.913 | 0:03:18.214 |
| 295 | Limitations of Consensus | 13:51:37.127 | 0:03:05.673 |
| 296 | Membership and Coordination Services | 13:54:42.800 | 0:04:46.399 |
| 297 | Allocating Work to Nodes | 13:59:29.199 | 0:02:43.830 |
| 298 | Service Discovery | 14:02:13.029 | 0:01:51.242 |
| 299 | Membership Services | 14:04:04.271 | 0:01:05.936 |
| 300 | Summary | 14:05:10.207 | 0:07:36.631 |