Skip to content

Designing Data-Intensive Applications chapters

About this audiobook · Recording details

Recording benjamin-lange-2021 · Narrated by Benjamin Lange

Showing 100 of 467 chapters

Chapter titles and times
ChapterTitleStartDuration
201Serializability9:04:49.7630:02:51.467
202Actual Serial Execution9:07:41.2300:02:07.695
203Encapsulating Transactions in Stored Procedures9:09:48.9250:02:50.562
204Pros and Cons of Stored Procedures9:12:39.4870:02:35.166
205Partitioning9:15:14.6530:02:00.752
206Summary of Serial Execution9:17:15.4050:00:59.772
207Two-Phase Locking (2PL)9:18:15.1770:02:18.563
208Implementation of Two-Phase Locking9:20:33.7400:02:06.185
209Performance of Two-Phase Locking9:22:39.9250:02:03.167
210Predicate Locks9:24:43.0920:02:22.487
211Index-Range Locks9:27:05.5790:02:49.656
212Serializable Snapshot Isolation (SSI)9:29:55.2350:01:32.073
213Pessimistic Versus Optimistic Concurrency Control9:31:27.3080:03:00.826
214Decisions Based on an Outdated Premise9:34:28.1340:01:52.903
215Detecting Stale MVCC Reads9:36:21.0370:01:29.054
216Detecting Writes That Affect Prior Reads9:37:50.0910:01:59.545
217Performance of Serializable Snapshot Isolation9:39:49.6360:02:21.883
218Summary9:42:11.5190:05:07.847
2198. The Trouble with Distributed Systems9:47:19.3660:02:28.682
220Faults and Partial Failures9:49:48.0480:03:36.130
221Cloud Computing and Supercomputing9:53:24.1780:07:38.068
222Unreliable Networks10:01:02.2460:03:17.949
223Network Faults in Practice10:04:20.1950:03:28.799
224Detecting Faults10:07:48.9940:03:04.166
225Timeouts and Unbounded Delays10:10:53.1600:03:03.873
226Network Congestion and Queueing10:13:57.0330:05:17.011
227Synchronous Versus Asynchronous Networks10:19:14.0440:01:58.769
228Can We Not Simply Make Network Delays Predictable?10:21:12.8130:06:13.610
229Unreliable Clocks10:27:26.4230:02:10.206
230Monotonic Versus Time-of-Day Clocks10:29:36.6290:00:21.408
231Time-of-Day Clocks10:29:58.0370:01:33.549
232Monotonic Clocks10:31:31.5860:02:27.802
233Clock Synchronization and Accuracy10:33:59.3880:04:58.536
234Relying on Synchronized Clocks10:38:57.9240:02:00.529
235Timestamps for Ordering Events10:40:58.4530:05:12.319
236Clock Readings Have a Confidence Interval10:46:10.7720:02:50.676
237Synchronized Clocks for Global Snapshots10:49:01.4480:03:24.107
238Process Pauses10:52:25.5550:08:08.274
239Response Time Guarantees11:00:33.8290:03:07.684
240Limiting the Impact of Garbage Collection11:03:41.5130:01:37.362
241Knowledge, Truth, and Lies11:05:18.8750:02:22.816
242The Truth Is Defined by the Majority11:07:41.6910:03:40.530
243The Leader and the Lock11:11:22.2210:02:27.802
244Fencing Tokens11:13:50.0230:02:42.464
245Byzantine Faults11:16:32.4870:06:35.311
246Weak Forms of Lying11:23:07.7980:02:00.822
247System Model and Reality11:25:08.6200:03:46.982
248Correctness of an Algorithm11:28:55.6020:01:36.188
249Safety and Liveness11:30:31.7900:02:48.037
250Mapping System Models to the Real World11:33:19.8270:02:55.661
251Summary11:36:15.4880:05:04.941
2529. Consistency and Consensus11:41:20.4290:04:14.664
253Consistency Guarantees11:45:35.0930:04:06.424
254Linearizability11:49:41.5170:02:51.898
255What Makes a System Linearizable?11:52:33.4150:09:37.487
256Relying on Linearizability12:02:10.9020:00:26.965
257Locking and Leader Election12:02:37.8670:01:39.618
258Constraints and Uniqueness Guarantees12:04:17.4850:02:03.213
259Cross-Channel Timing Dependencies12:06:20.6980:03:04.256
260Implementing Linearizable Systems12:09:24.9540:04:00.807
261Linearizability and Quorums12:13:25.7610:02:29.053
262The Cost of Linearizability12:15:54.8140:02:04.336
263The CAP Theorem12:17:59.1500:04:21.030
264Linearizability and Network Delays12:22:20.1800:02:50.026
265Ordering Guarantees12:25:10.2060:01:50.104
266Ordering and Causality12:27:00.3100:04:35.636
267The Causal Order Is Not a Total Order12:31:35.9460:03:23.731
268Linearizability Is Stronger Than Causal Consistency12:34:59.6770:02:29.053
269Capturing Causal Dependencies12:37:28.7300:02:32.799
270Sequence Number Ordering12:40:01.5290:02:22.686
271Noncausal Sequence Number Generators12:42:24.2150:03:25.978
272Lamport Timestamps12:45:50.1930:02:45.157
273Timestamp Ordering Is Not Sufficient12:48:35.3500:03:01.261
274Total Order Broadcast12:51:36.6110:02:32.002
275Using Total Order Broadcast12:54:08.6130:02:23.604
276Implementing Linearizable Storage Using Total Order Broadcast12:56:32.2170:04:16.869
277Implementing Total Order Broadcast Using Linearizable Storage13:00:49.0860:02:38.570
278Distributed Transactions and Consensus13:03:27.6560:04:23.342
279Atomic Commit and Two-Phase Commit (2PC)13:07:50.9980:01:13.622
280From Single-Node to Distributed Atomic Commit13:09:04.6200:03:56.243
281Introduction to Two-Phase Commit13:13:00.8630:03:03.242
282A System of Promises13:16:04.1050:04:22.532
283Coordinator Failure13:20:26.6370:02:29.671
284Three-Phase Commit13:22:56.3080:01:18.072
285Distributed Transactions in Practice13:24:14.3800:02:51.111
286Exactly-Once Message Processing13:27:05.4910:01:54.883
287XA Transactions13:29:00.3740:03:06.483
288Holding Locks While in Doubt13:32:06.8570:01:34.657
289Recovering from Coordinator Failure13:33:41.5140:02:08.232
290Limitations of Distributed Transactions13:35:49.7460:03:06.887
291Fault-Tolerant Consensus13:38:56.6330:05:01.771
292Consensus Algorithms and Total Order Broadcast13:43:58.4040:02:13.895
293Single-Leader Replication and Consensus13:46:12.2990:02:06.614
294Epoch Numbering and Quorums13:48:18.9130:03:18.214
295Limitations of Consensus13:51:37.1270:03:05.673
296Membership and Coordination Services13:54:42.8000:04:46.399
297Allocating Work to Nodes13:59:29.1990:02:43.830
298Service Discovery14:02:13.0290:01:51.242
299Membership Services14:04:04.2710:01:05.936
300Summary14:05:10.2070:07:36.631