An Optimized Design and Implementation Method of T-tree
WU Qing-zhang · Jisuanji gongcheng · 2013
As T-tree has not good cache behaviors and update efficiency,this paper gives some optimization design for T-tree.The structure of T-tree’s node is redesigned according to the technology of cache structure and layout,and the precursor and successor pointers are added into the node structure.That can make T-tree more cache conscious and enhances its ability of range query.When there is a data overflow while updating,multiple data items rather than a data item are transferred between nodes.So the chance of data overflows and rebalancing trees can be reduced and the update performance is improved.Experimental results show that the improved T-tree has a better performance in query and updating and can save 18% main memory space.