k-tree core problem with degree constraint in tree network

The paper proposes and develops an index method based on 3D R-tree and R*-tree algorithm which shows its advantages in query efficiency comparing with 3D R-tree and HR-tree.

In the process of this realization, elaborate explanations have been made of the source pattern of the dendritic catalog data, the use of handle as well as the key priperties of TreeViewItem which can store the structure of data.