知识卡片
日志先行再形成有序表
书中基于 Cassandra 的写路径先把请求写入提交日志,再更新内存结构,到阈值后刷成磁盘 SSTable。有序键值表便于按键检索,先写日志则为内存内容尚未刷盘时的恢复保留依据。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 键值存储 · 查看原书依据
Write path Figure 6-19 explains what happens after a write request is directed to a specific node. Please note the proposed designs for write/read paths are primary based on the architecture of Cassandra [8]. 1. The write request is persisted on a commit log file. 2. Data is saved in the memory cache. 3. When the memory cache is full or reaches a predefined threshold,
参考来源
- 位置:《System Design Interview – An insiders guide, Second Edition》第06章《键值存储》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0017_split_000.html)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:Write path Figure 6-19 explains what happens after a write request is directed to a specific node. Please note the proposed designs for write/read paths are primary based on the architecture of Cassandra [8]. 1. The write request is persisted on a commit log file. 2. Data is saved in the memory cache. 3. When the memory cache is full or reaches a predefined threshold,