Implementing An N-Level Nested Tree In PHP And PostgreSQL, Part 1
This series of articles is about implementing a nested tree using PHP and PostgreSQL. The theory and code in these articles also applies to MySQL, not just PostgreSQL.
An N-Level nested tree is a way to represent hierarchical data, such as a list of directories and files in your operating system, or the listings in a directory such as the Open Directory Project. There can be any number of levels and any number of elements within each level.
The goal is to be able lookup data in the tree as quickly as possible with minimal strain on resources. We will be implementing this using the nested tree model by Joe Celko.
There are three articles in this series:
- Theory behind the nested tree model. How it all works and how to look up data
- Implementing the model in PHP and PostgreSQL
- Using the model in a real-world web application