知识卡片
信息流推拉各有成本
写扩散在发布时把帖子 ID 推到好友的时间线,读快但对大粉丝用户写放大严重;读扩散在读取时聚合,节省不活跃用户的预计算却增加读延迟。选择取决于读写比例和关系规模。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 第11章 信息流
原书出处 · 1 处
- 信息流 · 查看原书依据
Fanout on write. With this approach, news feed is pre-computed during write time. A new post is delivered to friends’ cache immediately after it is published. Pros: •The news feed is generated in real-time and can be pushed to friends immediately. •Fetching news feed is fast because the news feed is pre-computed during write time. Cons: •If a user has many friends, fetching the friend
参考来源
- 位置:《System Design Interview – An insiders guide, Second Edition》第11章《信息流》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0027_split_003.html)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:Fanout on write. With this approach, news feed is pre-computed during write time. A new post is delivered to friends’ cache immediately after it is published. Pros: •The news feed is generated in real-time and can be pushed to friends immediately. •Fetching news feed is fast because the news feed is pre-computed during write time. Cons: •If a user has many friends, fetching the friend