3.4 LSM-trees: Component Sizes(2)
We define the size of an LSM-tree component, S(Ci), as the number of bytes of entries it contains at the leaf level;
我们定义LSM-tree组件的size,S(Ci)表示包含的叶子结点内容字节数;
the size of component Ci is denoted by Si, S(Ci) = Si, and S is the total size of all leaf level entries in all components, S = Σi Si.
Ci通过Si表示,S(Ci) = Si,S是所有叶子结点内容总大小,S = Σi Si.
We assume there is some relatively steady rate R of insertion, in bytes per second, to component C0 of the LSM-tree, and for simplicity that all newly inserted entries live to circulate out to component CK by a succession of rolling merge steps.
我们假设插入存在稳定速率R,字节每秒基本稳定输入到C0,为了简单起见,所有新插入的条目都可以通过一系列滚动合并步骤循环到组件CK。
We also assume that each of the components, C0, C1, . . . , CK-1, has a size close to a maximum threshold size to be determined by the current analysis.
我们还假设每个分量,C0, C1,…, CK-1,其大小接近当前分析所确定的最大阈值大小。
The component CK is assumed to have a relatively stable size, because of deletes balancing inserts over some standard time period.
组件CK被假定有一个相对稳定的大小,因为要在某个标准时间段内删除平衡插入。
The deletes from component CK can be thought of as taking place without any addition to the rate of insertion R to component C0.
组分CK的删除可以认为是在不增加组分C0的插入速率R的情况下发生的。