知识卡片
聊天存储适配历史访问
聊天历史量大,近期数据访问最频繁,也有搜索与跳转到旧消息的随机访问需求。存储选型要同时考虑这些模式及分区方式,不能只因近期消息多就丢掉长尾读取要求。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 第12章 聊天
原书出处 · 1 处
- 聊天 · 查看原书依据
The second is unique to chat systems: chat history data. It is important to understand the read/write pattern. •The amount of data is enormous for chat systems. A previous study [2] reveals that Facebook messenger and Whatsapp process 60 billion messages a day. •Only recent chats are accessed frequently. Users do not usually look up for old chats. •Although very recent chat history is viewed
参考来源
- 位置:《System Design Interview – An insiders guide, Second Edition》第12章《聊天》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0029_split_002.html)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:The second is unique to chat systems: chat history data. It is important to understand the read/write pattern. •The amount of data is enormous for chat systems. A previous study [2] reveals that Facebook messenger and Whatsapp process 60 billion messages a day. •Only recent chats are accessed frequently. Users do not usually look up for old chats. •Although very recent chat history is viewed