SEQUENTIAL RETRIEVAL OF B-TREES AND A FILE STRUCTURE WITH A DENSE B-TREE INDEX

来源期刊：中南大学学报(英文版)1999年第1期

论文作者：Ren Zhaoyang Hideo Tamamoto

文章页码：68 - 73

Key words：B-tree; B⁺-tree; data structure; file organization; retrieval method

Abstract: A simple fast method is given for sequentially retrieving all the records in a B-tree. Afile 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.