Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Anhui Institute of Education》 2006-06
Add to Favorite Get Latest Update

A High Efficient Method of Visualization Management Based on Tree Structure of Relational Model

PAN Jie-zhu(Department of Computer Science and Technology,Anhui Institute of Education,Hefei 230061,China)  
Commonly the complexity of tree time of tree-structured data based on relational model is O(n2).When the scale of tree becomes larger,the response time to display tree-structured data is longer,which will affect the using efficiency of the users.Therefore,this paper proposes the storage structure of tree data based on relational model,and studies and implements a high efficient method of visualization management based on tree structure of relational model.The experiments prove that this method is simple to implement,and has a better time performance and practical value.
【CateGory Index】: TP311.13
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Citations】
Chinese Journal Full-text Database 3 Hits
1 Zhang Xiangli Zhou Dexin (Dept. of Communication and Information Engineering,Guilin 541004,China);The Hiberarchy Data Process in the Application of RDBS[J];JOURNAL OF GUILIN INSTITUTE OF ELECTRONIC TECHNOLOGY;2000-03
2 LIU Han-xing,SUN Wei-wei (Computer Department,South china Agricultural University,Guangzhou510 642China);The Management about the Tree-Telation Data in Delphi[J];Modern Computer;2002-12
3 Author HUANG Dongquan, ZHANG Min (Computer Center, Air Force Logistic Institute of PLA,Xuzhou 221000,China);The Implementation of Tree Data Structure Based on Relational Representation[J];JOURNAL OF XUZHOU NORMAL UNIVERSITY(NATURAL SCIENCE EDITION);1999-02
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 SUN Ze-yu,ZHAO Guo-zeng,SHU Yun-xing,(Dept.of Computer,Luoyang Technology College,Luoyang 471003,China);The Recursive and Non-recursive Algorithm of Post-traversing Binary Tree[J];Journal of Anhui Electrical Engineering Professional Technique College;2006-01
2 KAN Tao,CHENG Jia-xing,QIAN Fu-lan,YU Cheng-dan(Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education,Anhui University,Hefei 230039,China);An amelioration to D_timetable algorithm of time planning[J];Journal of Anhui University(Natural Sciences);2005-05
3 FANG Qun (College of Mathematics and Computer Science, Anhui Normal University,Wuhu 241000 ,China);APPLICATION OF THE ISOMETRIC RANDOM SAMPLE ALGORITHM IN COMPUTER GROUP[J];Journal of Anhui Normal University(Natural Science);2002-03
4 CHEN Peng (Information Science and Computer Dept.of Anqing Teachers College,Anqing 246011,China);The Recursive And Non-recursive Algorithm of Post-traversing Binary Tree[J];Journal of Anqing Teachers College(Natural Science Edition);2005-02
5 CHANG Rong_qing(Centre of Information Qianshan District of Anshan,Anshan 114041,China);Research on Design and Realization of Computer Reasoning Software[J];Journal of Anshan Institute of Iron and Steel Technology;2001-04
6 DONG Ming zhe YU Wen bo YANG Hong yan (Department of Mathematics,Anshan Normal University,Anshan Liaoning 114005,China);The Application of Huffman Algorithm in Scheduling Public Travel Services[J];Journal of Anshan Teachers College;2002-03
7 Wang Zhigang(Vocational College,Liaoning Tecnical University Fuxin 123000);Discussion on the Teaching Method of <Data Structure>Curriculum[J];Office Informatization;2008-12
8 HUANG Wan-rong1,WANG Chun-xia2,OU Yuan1,DENG Jiang-hu1(1.Dept.of Equipment Command & Management,Ordnance Engineering College,Shijiazhuang 050003,China;2.Wuyou Middle School,Yancheng 224041,China);Structure Analysis and Operation Algorithm of “Army Forms in Organizational System,Campaign Ability and Safeguard Ability” Evaluation Standards[J];Ordnance Industry Automation;2006-12
9 Feng Yushan (Beijing Vocational & Technical Institute of Industry,Beijing 100042);Using Huffman Tree to Establish the Best Decision Algorithm[J];Journal of Beijing Vocational & Technical Institute of Industry;2002-02
10 JIAO Li-nan,TANG Zhen-min (School of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing 210094,Jiangsu,China);A Convex Partition Algorithm for a Polygon with Holes[J];Acta Armamentarii;2008-03
China Proceedings of conference Full-text Database 4 Hits
1 HU Xue-gang,ZHANG Jing,ZHOU Hong-juan,ZHANG Yu-hong,WANG De-xing ( School of Computer and Information,Hefei University of Technology,Hefei 230009,China);Design on Practical Hierarchy of Data Structures Course[A];[C];2005
2 Du Hua Zhou Dongming Zhao Dongfeng Bai Yunhong Lin Lin (Department of Communications Engineering,Information College,Yunnan University,Kunming 650091,China);Shortest-path algorithm using adjustable weight pulse-coupled neural network[A];[C];2007
3 Yu Hongyong, Zhao Tiejun, Zheng Dequan, Wang YueYin MOE-MS Key Laboratory' of Natural Language Processing and Speech Harbin Institute of Technology, Harbin, 150001;Research on an Effective Retrieval Method Oriented to File[A];[C];2006
4 Gaoqian, Dewang chen (State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,Beijing 100044 School of Electronics and Information Engineering , Beijing Jiaotong University,Beijing 100044);Study on dignity track map Based on graph Theory[A];[C];2007
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved