m***o
发帖数: 2 | 1 嘿，各位，我最近遇到一道题，希望在在这里有哪位能帮帮忙，谢谢
！！！
题目如下，希望能尽快给予答复。
The leaf nodes of a B+ are data pointers which either point
to records or blocks. One of the advantages of B+ trees is
that they support both random and sequential access.
However, there is no requirement that if two records are
logically in sequence that they need to be in the same block
physically or in adjacent blocks physically. Periodic
re-organization might be a good strategy. Develop a
tradeoff function that might be useful in determin | m***o
发帖数: 2 | 2 嘿，各位，我最近遇到一道题，希望在在这里有哪位能帮帮忙，谢谢
！！！
题目如下，希望能尽快给予答复。
The leaf nodes of a B+ are data pointers which either point
to records or blocks. One of the advantages of B+ trees is
that they support both random and sequential access.
However, there is no requirement that if two records are
logically in sequence that they need to be in the same block
physically or in adjacent blocks physically. Periodic
re-organization might be a good strategy. Develop a
tradeoff function that might be useful in determin | a*****a
发帖数: 438 | 3 set fanout=n, only use insertion as example:
if the data being inserted is the n(1-x) member of the leaf,
it's time to split?
【在 m***o 的大作中提到】
: 嘿，各位，我最近遇到一道题，希望在在这里有哪位能帮帮忙，谢谢
: ！！！
: 题目如下，希望能尽快给予答复。
: The leaf nodes of a B+ are data pointers which either point
: to records or blocks. One of the advantages of B+ trees is
: that they support both random and sequential access.
: However, there is no requirement that if two records are
: logically in sequence that they need to be in the same block
: physically or in adjacent blocks physically. Periodic
: re-organization might be a good strategy. Develop a
|
|
