%0 Journal Article
%T RFN-B+-Tree Index File and Its Availability<br>RFN-B+树索引文件及其有效性
%A YAO Qing-d
%A YANG Gui-zhen
%A ZHANG Jun-xin
%A <br>姚卿达
%A 杨桂桢
%A 张俊欣
%J 软件学报
%D 1998
%I 
%X 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.
%K B+-tree
%K index
%K availability
%K algorithm<br>B+树
%K 索引
%K 有效性
%K 算法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=C3769778EA48C0871E56A7ADEC8BCD79&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=708DD6B15D2464E8&sid=45D68DF69BA881EC&eid=AC3946AB81989513&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=9