摘要
在数据文件中,数据搜索可用顺序查找等方法实现,但是这些方法速度较慢。这里介绍了多路查找树——B-树,给出其定义和性能分析,并且对它在数据搜索中的应用进行了举例分析。
The usual method can be used to search a data with file-sequence,but it is too slow.In this article B-tree was introduced, and its property analysis was discussed, and an example about the application of B-tree in data retrieval was presented.
出处
《浙江海洋学院学报(自然科学版)》
CAS
2005年第1期80-81,94,共3页
Journal of Zhejiang Ocean University(Natural Science Edition)