Pagination of B*-trees with variable-length records
Pagination of B*-trees with variable-length records
复制标题
具有可变长度记录的 B* 树的分页
DOI：
--
复制
发表时间：
1977
期刊：
影响因子：
--
通讯作者：
E. McCreight
中科院分区：
文献类型：
--
作者：
E. McCreight
提出了一种针对具有变长记录的B*树进行分页的策略。如果每种长度的记录在文件中均匀分布，并且文件中存在多种记录长度，那么这种策略会产生具有快速访问时间的较浅的树。介绍了该策略在一个应用中的性能，与另一种策略的性能进行了比较，并进行了分析。
A strategy is presented for pagination of B*-trees with variable-length records. If records of each length are uniformly distributed within the file, and if a wide distribution of record lengths exists within the file, then this strategy results in shallow trees with fast access times. The performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.