¹Computer Academy, Beihang University, Beijing, China
²Beijing audit firm, Beijing, China
³Beijing Union University, Beijing, China

---

Abstract—At present the third-part open source web-tree components and related algorithms have the shortcomings of poor compatibility, small data-scale and low running efficiency. The paper aims at design and implementation of a universal web-tree service component (WTSC) for larger-scale data maintenance to overcome these deficiencies mentioned above. By comparing and analyzing the existing algorithms, an improved algorithm named M-C was put forward to meet the demands of large-scale web-tree data loading, adding, removing and dragging. Then pseudo-code descriptions of M-C algorithm were given in detail. The paper gave a comprehensive formal description of WTSC to illustrate its abstract logic model. By using SCA, SOA, SSH, and UML technologies, software development framework named SOA-SSH, service access interface model named SCA and UML diagrams were given to develop and implement the application prototype of WTSC. To verify its performance, a comparative analysis was made among three different schemas. From the data test results, conclusions can be drawn that WTSC designed by this paper had better performance at large-scale data loading and maintenance, at the same time as a result of SCA model and SOA-SSH framework, it had friendlier UI and better compatibility and extensibility. Finally, future research work was prospected.

Index Terms—SCA, SOA-SSH, large-scale, web-tree data

[PDF]

Cite: Zhidong Wang, Lichao Ye, Wenfa Li, "Design and Implementation of Universal Web-Tree Service Component for Large-Scale Data Maintenance," Journal of Software vol. 9, no. 7, pp. 1781-1789, 2014.