知识卡片
补全统计与在线查询分离
原始查询先写日志,再聚合频率、异步构建前缀树并发布缓存。这样在线请求不必同步更新全部祖先节点;周更适合允许陈旧的场景,不能用它满足突发热点的实时补全。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 搜索自动补全 · 查看原书依据
Data gathering service In our previous design, whenever a user types a search query, data is updated in real-time. This approach is not practical for the following two reasons: •Users may enter billions of queries per day. Updating the trie on every query significantly slows down the query service. •Top suggestions may not change much once the trie is built. Thus, it is unnecessary to
参考来源
- 位置:《System Design Interview – An insiders guide, Second Edition》第13章《搜索自动补全》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0031_split_003.html)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:Data gathering service In our previous design, whenever a user types a search query, data is updated in real-time. This approach is not practical for the following two reasons: •Users may enter billions of queries per day. Updating the trie on every query significantly slows down the query service. •Top suggestions may not change much once the trie is built. Thus, it is unnecessary to