← 返回起始笔记位置

知识卡片

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

跨分片查询要汇聚部分结果

理解等级:高级

可定位分片的查询只访问目标子集;全局搜索则扇出相关分片并汇聚。并行降低部分等待,却增加总资源、慢分片拖尾和不完整结果处理;路由器必须明确超时、分页排序及部分失败语义。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • Data Storage Strategies · 查看原书依据

      While our partitioning strategy optimizes for common access patterns, we still need to handle queries that span multiple partitions. For example, when a customer searches for wireless headphones across all categories, or when generating reports that aggregate data across regions.

    参考来源

    - 位置:《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) - 结论依据:原文的机制或对比支持以下核心判断:可定位分片的查询只访问目标子集;全局搜索则扇出相关分片并汇聚。 本卡将相邻说明中的适用限制保留为解释。 - 原始内容:While our partitioning strategy optimizes for common access patterns, we still need to handle queries that span multiple partitions. For example, when a customer searches for wireless headphones across all categories, or when generating reports that aggregate data across regions.