Infinite Tree Structure Realization in Programming
Tree Structure plays an important role on the structure design of the program and database. According to the analysis on the Infinite Tree Structure, the paper presents two methods to implement it based on the conventional relational database, which are calledThe Node Recursion Method and The Level Coding Method respectively. Also, this paper explains the two methods by some details including an example,the typical realization algorithms and the main table structure in database. Finally, the performance and efficiency of the two methods are discussed thoroughly from different areas.
Linear structure Non-linear structure The Node Recursion Method The Level Coding Method
TAN Ran LEI Jinmin XUE Yanxin
Department of Computer Science School of Computer Science & Technology Wuhan University of Technolog Department of Computing &Information Technology School of Information science & Engineering Fudan Un
国际会议
厦门
英文
43-46
2006-07-27（万方平台首次上网日期，不代表论文的发表时间）