Optimization of history tree in 3DR-tree index structure

摘要：

　　Many optimizations have been done to 3DR-tree index structure and many opinions have been proposed.Modification by splitting mechanism is one of them.There are two index trees in 3DR-tree index structure after modification:one is a history tree for past data storage and the other is an active tree for current data storage.In this article,optimization of history tree is firstly done and is proved theoretically.Then a correspondent insert algorithm is designed.

关键词： 3DR-tree index structure R*-Tree structure model history data insert algorithm

作者: Zhang Zhi-tong

作者单位: Faculty of Technology,Harbin University Harbin,china

会议类型: 国际会议

会议名称: 2013 2nd International Conference on Computer Science and Electronics Engineering(ICCSEE2013)(2013年第二届计算机科学与电子工程国际会议)

会议地点: 杭州

会议语种:英文

页码: 2079-2081

在线出版日期: 2013-03-22（万方平台首次上网日期，不代表论文的发表时间）