RFN-B+-Tree Index File and Its Availability
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Based on the comparison of the conventional definitions of B-tree and B+-tree, and their manipulating algorithms, a new definition of B+-tree: RFN-B+-tree is presented in order to achieve higher space efficiency and higher availability. Its space efficiency compared with conventional B+-tree is analyzed firstly. Then the availability of RFN-B+-tree index file in terms of its full-link pointer structure together with two modules that support this availability: random access algorithm based on virtual root node, and node restructuring algorithm are discussed.

    Reference
    Related
    Cited by
Get Citation

姚卿达,杨桂桢,张俊欣. RFN-B+树索引文件及其有效性.软件学报,1998,9(11):820-827

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 02,1997
  • Revised:October 17,1997
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063