知识卡片

普通读书笔记卡 · 3633

B树降低磁盘访问层数

理解等级:中级

B树是面向磁盘存储的平衡搜索树。它的性能既取决于计算时间,也取决于磁盘访问次数;访问次数随树高增加,因此B树操作会保持较低树高。具体节点规则留待专章。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第五部分 高级数据结构 · 查看原书依据

      Chapter 18 presents B-trees, which are balanced search trees specifically designed to be stored on disks. Since disks operate much more slowly than random-access memory, B-tree performance depends not only on how much computing time the dynamic-set operations consume but also on how many disk accesses they perform. For each B-tree operation, the number of disk accesses increases with the height of the B-tree, but B-tree operations keep the height low.

    参考来源

    - 位置:《算法导论(第4版)》第五部分引言《高级数据结构》(OEBPS/part005.xhtml,文本字符[0,5000))。 - 结论依据:原文明确把B树定位为磁盘上的平衡搜索树,并指出磁盘访问次数随树高增加、B树操作保持低树高。 - 原始内容:Chapter 18 presents B-trees, which are balanced search trees specifically designed to be stored on disks. Since disks operate much more slowly than random-access memory, B-tree performance depends not only on how much computing time the dynamic-set operations consume but also on how many disk accesses they perform. For each B-tree operation, the number of disk accesses increases with the height of the B-tree, but B-tree operations keep the height low.