What method do you use for storing hierarchical data in a relational database and why?
The two methods that I personally am aware of are:
- Adjacency List
- Modified Pre-order Tree Traversal
Have you found one to be more efficient once the tree gets beyond a certain size?
Do you use transactions when using either method?
I personally use the Modified Preorder Tree Traversal as I don’t like unecessary queries (if I can get all required info in one query I will). I have not personally used Adjacency List as I personally am new to working with hierarchical in a relational database.