The realization of high efficiently displaying the tree structure in the database
Xinna Ma
Abstract
Xinna Ma
Abstract
According to the displaying character of the tree structure and the access sequence of threaded binary tree,a new table structure to save the tree is introduced.Based on the new table structure,a new algorithm to display tree structure is carried out,at the same time,the algorithm to add or delete the tree node and to search all of the child-nodes is given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to the displaying character of the tree structure and the access sequence of threaded binary tree,a new table structure to save the tree is introduced.Based on the new table structure,a new algorithm to display tree structure is carried out,at the same time,the algorithm to add or delete the tree node and to search all of the child-nodes is given.
Key concepts: Computer science, Segment tree, Interval tree, Fractal tree index, Tree (set theory), Search tree, Tree structure, Data structure