2005Hebei Sheng Kexueyuan xuebaoRequires access

The realization of high efficiently displaying the tree structure in the database

Xinna Ma

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Segment tree, Interval tree, Fractal tree index, Tree (set theory), Search tree, Tree structure, Data structure

Related papers

Back to paper searchBrowse research topicsOriginal source
The realization of high efficiently displaying the tree structure in the database — Research Paper | ScholarLens