By Topic

An efficient tree generation algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhan-Fen Li ; Department of Continuing Education, Taiyuan Institute of Technology, Shanxi, China, 030008 ; Li-Qun Kuang

In this paper, an efficient tree generation algorithm based on prefix code is proposed. The algorithm utilizes the sequence consistency of the database record set and the preorder traversal tree. It only need to query on the database and traversal the tree nodes one time respectively, then all nodes can be added to the tree one by one. There is only one cycle that is the traverse of the tree nodes collection, so the time complexity of the algorithm is O (n). Experimental results show that the tree nodes and their child nodes can be queried and stated rapidly.

Published in:

2010 International Conference on Computer Application and System Modeling (ICCASM 2010)  (Volume:15 )

Date of Conference:

22-24 Oct. 2010