知识卡片
布隆过滤减少无效查盘
读取先查内存,未命中时借助布隆过滤器筛出可能包含目标键的 SSTable,再读取数据。过滤器用于减少不必要的磁盘访问;“可能存在”仍要读取核实,不能把它当作完整数据或精确索引。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 键值存储 · 查看原书依据
Read path After a read request is directed to a specific node, it first checks if data is in the memory cache. If so, the data is returned to the client as shown in Figure 6-20. If the data is not in memory, it will be retrieved from the disk instead. We need an efficient way to find out which SSTable contains the key. Bloom
参考来源
- 位置:《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)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:Read path After a read request is directed to a specific node, it first checks if data is in the memory cache. If so, the data is returned to the client as shown in Figure 6-20. If the data is not in memory, it will be retrieved from the disk instead. We need an efficient way to find out which SSTable contains the key. Bloom