According to the property of general balanced trees,analysis the retrieval ability of it by theoretical proof,and makes an expres-sion of upper limit of retrieval time.

the modified direct method,the AVL tree method and the Hash table m.

This paper presents a new compound data structure named as Cross AVL based on cross list and AVL tree for the matrix storing.

The traditional algorithm for AVL tree rebalancing is the rotation method,which uses methods of left-rotation,right-rotation,left first rotation then right and right first rotation then left to deal with the different unbalance structures respectively.

Active search circle algorithm of isoline model based on balanced binary tree;

In CPSD, video segments were prefetched and stored in peers along a balanced binary tree in distributable manner, which assisted locating a given playing position quickly during streaming playback.

In this paper,nodes are arranged and sorted according to a specified rule,and are organized by the data structure of a balanced binary tree,by which the process of confirming is accelerated with the help of topological relationships embodied in the spatial objects.

This paper discusses the development of spatio-temporal data modeling in the spatio-temporal database and designes the two-level AVL-Tree spatio-temporal data model based on Realms for spatio-temporal database system-STADBSII.

Study of a P2P overlay network based on binary balance tree