← 返回起始笔记位置

知识卡片

普通读书笔记卡 · 2313.e.5.f.10.b.3.h.1.a.2

异步派生数据需要补漏

理解等级:高级

评论先写真源,再异步更新搜索、评分和缓存,可让非关键读取容忍暂时滞后。若保存后发布前崩溃,更新可能漏发;需可靠交接与恢复机制,并防止旧聚合结果覆盖新结果。示意代码本身不能证明最终必收敛。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • Data Storage Strategies · 查看原书依据

      Not all operations in our system require strong consistency. Consider our product review system. When a customer posts a new review, it is not critical that all users see it immediately.

    参考来源

    - 位置:《Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…》第09章《Data Storage Strategies》(来源项目book-sources;源文件:extracted/Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…/_epub-src/OPS/ch09.xhtml) - 结论依据:原文的机制或对比支持以下核心判断:评论先写真源,再异步更新搜索、评分和缓存,可让非关键读取容忍暂时滞后。 本卡将相邻说明中的适用限制保留为解释。 - 原始内容:Not all operations in our system require strong consistency. Consider our product review system. When a customer posts a new review, it is not critical that all users see it immediately.