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
国际会议
2010 International Conference on Future Information Technology(2010年未来信息技术国际会议 ICFIT 2010)
长沙
英文
1018-1020
2010-12-14(万方平台首次上网日期,不代表论文的发表时间)