Lazy Loading the Dojo Tree
- 2,714 views
This article discusses web applications that use lazy loading to create a responsive, tree like, representation of a hierarchically structured data. Instead of getting the entire tree structure at ...
This article discusses web applications that use lazy loading to create a responsive, tree like, representation of a hierarchically structured data. Instead of getting the entire tree structure at once, a lazy load approach is used to fetch only a single node immediate subordinates on demand. This article shows how to use the Dojo libraries and the Dojo Tree widget in particular, to easily create visual representation of a hierarchical list and update it dynamically.
Graph theory is concerned with the topology of interconnected sets of nodes, abstracting away from concrete objects and the exact nature of the relation between objects. Trees are special case of graphs: Tree is a graph whose nodes are all reachable from some starting node and one that has no cycles.
On the server side, a simple web service is created to serve XHR requests. Domain service is accessing repository having in backend data stored in ini formated text files.
The sample web application is developed using the NetBeans IDE.
The first part of the article was presented at LinuxTag 2010 conference.
Source code and UML models: https://svn.kenai.com/svn/phplazyloaddojotree~subversion
- Total Views
- Views on SlideShare
- Embed Views