April 30, 2003Storing Hierarchical Data in a Database Key Takeaways Storing hierarchical data in a database can be achieved using two major approaches: the adjacency list model and the modified preorder tree traversal algorithm. The adjacency list model is more elegant and simple, but can be slow and inefficient for large trees due to the use of recursion. In the adjacency list method, each node i
{{#tags}}- {{label}}
{{/tags}}