共 50 条
Sequential retrieval of B-trees and a file structure with a dense B-tree index
被引:0
|作者:
Zhaoyang Ren
Tamamoto Hideo
机构:
[1] Central South University of Technology,College of Information Engineering
[2] Akita University,Department of Information Engineering
来源:
Journal of Central South University of Technology
|
1999年
/
6卷
/
1期
关键词:
B-tree;
B;
-tree;
data structure;
file organization;
retrieval method;
D O I:
10.1007/s11771-999-0037-z
中图分类号:
学科分类号:
摘要:
A simple fast method is given for sequentially retrieving all the records in a B-tree. A file structure for database is proposed. The records in its primary data file are sorted according to the key order. A B-tree is used as its dense index. It is easy to insert, delete or search a record, and it is also convenient to retrieve records in the sequential order of the keys. The merits and efficiencies of these methods or structures are discussed in detail.
引用
收藏
页码:67 / 72
页数:5
相关论文