Designing Data-Intensive Applications

Posted on Edited on In Views: Disqus: Word count in article: 1.2k Reading time ≈ 1 mins.

Designing Data-Intensive Applications

Designing Data-Intensive Applications|200

  • 作者: Martin Kleppmann
  • 简介:
  • 出版时间:
  • ISBN:
  • 分类:
  • 出版社: O’Reilly Media Inc.
  • 字数: 1230979
  • 在线阅读: 微信读书
  • 划线数量: 1
  • 想法数量: 2

笔记

Preface


📌 plethora
💭 /ˈpleθərə/
n. 太多,过多;过剩
n. 【医】多血(症)

  • ⏱ 2024-05-17 09:44:34 ^19836794-7RfySJ47Z


📌 barely
💭 /ˈbeəlɪ/
ad. 仅仅,只不过;几乎不,简直没有
ad. 贫乏地,不充分地;光秃秃地
ad. ⟨古⟩公开地;不加掩饰地;不加发挥地

  • ⏱ 2024-05-17 19:17:10 ^19836794-7RganP8fl

1. Reliable, Scalable, and Maintainable Applications

📌 The Internet was done so well that most people think of it as a natural resource like the Pacific Ocean,rather than something that was man-made. When was the last time a technology with a scale like that was so error-free?Alan Kay, in interview with Dr Dobb’s Journal (2012)

  • ⏱ 2024-12-16 15:01:56 ^3-1300-1890

Distributed Transactions and Consensus

📌 This is no coincidence: it can be proved that a linearizable compare-and-set (or increment-and-get) register and total order broadcast are both equivalent to consensus [28, 67]. That is, if you can solve one of these problems, you can transform it into a solution for the others. This is quite a profound and surprising insight!
It is time to finally tackle the consensus problem head-on, which we will do in the rest of this chapter.    
Distributed Transactions and Consensus
   Consensus is one of the most important and fundamental problems in distributed computing.

  • ⏱ 2025-03-25 13:26:15 ^34-23148