This class is meant to manage tree database structure using Jeo Celko's nested sets approach.
You can add node with 7 queries, delete a node with subnodes with 4 queries and move node with 11 queries.
The number of queries per action does not depend on the number of sub-nodes, so it is a scalable solution.
| Ratings | Utility |
Consistency |
Documentation |
Examples |
Tests |
Videos |
Overall |
Rank |
| All time: |
Sufficient (64.3%) |
Sufficient (67.9%) |
- |
Not sure (42.9%) |
- |
- |
Not sure (43.2%) |
1641 |
| Month: |
Not yet rated by the users |
| Link |
Description |
| Help! My Hierarchy is Slow - Faster Hierarchies with Nested Sets |
A great many applications, including many that I’ve worked on, have a hierarchy of things: of parts, of people, of organizations, etc... |
| Nested Sets |
Once again faced with a situation where this simple algorithm is vital and again confronted with the fact that on the Internet nothing is working under PHP... |
| Nested Sets |
Once again faced with a situation when the algorithm is simply vital and again confronted with the fact that the proposed network is nothing working under PHP.. |
No application links were specified for this class.

If you know an application of this package, send a message to the
author to add a link here.
| File |
Role |
Description |
ccelko.php |
Class |
CCelkoNastedSet class file |
sample.php |
Example |
Sample file for CCelkoNastedSet class |