Optimization of history tree in 3DR-tree index structure
Authors
Zhi-tong Zhang
Corresponding Author
Zhi-tong Zhang
Available Online March 2013.
- DOI
- 10.2991/iccsee.2013.523How to use a DOI?
- Keywords
- 3DR-tree, index structure, R*-Tree structure model, history data insert algorithm
- Abstract
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.
- Copyright
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Zhi-tong Zhang PY - 2013/03 DA - 2013/03 TI - Optimization of history tree in 3DR-tree index structure BT - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013) PB - Atlantis Press SP - 2078 EP - 2080 SN - 1951-6851 UR - https://doi.org/10.2991/iccsee.2013.523 DO - 10.2991/iccsee.2013.523 ID - Zhang2013/03 ER -