malhuda/CodeIgniter
1
0
Fork 0
mirror of https://github.com/bcit-ci/CodeIgniter.git synced 2025-02-20 11:13:29 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

First upload

World Wide Web Server 2012-07-04 16:03:36 -07:00
parent be3c8cc6fc
commit cc68b6648a
1 changed files with 9 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Nested-sets.md

@ -12,4 +12,12 @@ Enter then, an appropriate alternative method for handling tree data suited to s
The nested sets approach involves giving each node of the tree two integer references, one on its left hand side and the other on its right hand side. The left hand side of the root node is always '1'. The rest of the tree is numbered by travelling down the left hand side and up the right hand side of every node until you get back to the right hand side of the root node, where the number used will be exactly twice the number of nodes in the tree. Please see the reference articles for further information on this.
[h3]Nested_sets_model.php[/h3]
[h3]Nested_sets_model.php[/h3]
[h3]Download the package[/h3]
[[File:CI_nested_sets.zip]]
[h3] References [/h3]
[url=http://www.dbmsmag.com/9604d06.html]DBMS Online magazine: Joe Celko article[/url]
[url=http://www.sitepoint.com/article/hierarchical-data-database/2]Sitepoint article: Hierarchical Data in a Database[/url]
[url=http://www.edutech.ch/contribution/nstrees/index.php]Nested Set trees[/url]