5. Cost-Performance Comparisons with Other Access Methods（5）
Most existing disk-based access methods are Continuum structures, including B-trees [5] and its large number of variants such as SB-trees [21], Bounded Disorder Files [16], various types of hashing schemes such as extendible hashing [9], and a myriad others. However, there are a few access methods which migrate their entries from one segment to another: MD/OD R- Trees of Kolovson and Stonebraker ([15]) and Time-Split B-trees of Lomet and Salzberg ([17], [18]). The Differential File approach [25] also collects up changes in a small compo- nent, later performing updates to the full-sized structure. We will consider these structures in a bit more depth.
大多数现有的基于磁盘的访问方法是Continuum结构，包括b -树[5]及其大量的变种，如sb -树[21]、有界无序文件[16]、各种类型的散列方案，如可扩展的散列[9]，以及无数其他。然而，有一些访问方法可以将它们的条目从一个段迁移到另一个段:MD/OD R- Kolovson和Stonebraker树([15])和Lomet和Salzberg的时间分裂b树([17]，[18])。差异文件方法[25]还在一个小组件中收集更改，然后对完整结构执行更新。我们将更深入地考虑这些结构。(有道翻译)
todo：自己翻译
