摘要
本文给出两种构造三阶Ｂ树的算法，证明算法的时间复杂性，并给出用三阶Ｂ树实现热力公司的数据管理实例。
This paper gives two kinds of algorithms to construct 3rd-order B-trees. Thetime complexities of the algorithms are proved.It also illustra ies the application of 3rd-order B-trees to solve the data management problems in Heating Poaer Company.
出处
《小型微型计算机系统》
CSCD
北大核心
1995年第9期37-43,共7页
Journal of Chinese Computer Systems
