I’ve spent the last few hours trying to find the solution to this question online. I’ve found plenty of examples on how to convert from nested set to adjacency… but few that go the other way around. The examples I have found either don’t work or use MySQL procedures. Unfortunately, I can’t use procedures for this project. I need a pure PHP solution.
I’d need a MySQL query that moves a node and all its children within a nested set. I found this site, but that function just seems so illogical – there’s no universeid or treeid in a nested set model, and the code itself is just longer than what feels required. The only extra column I’ve got in the table is parent.
I have an MPTT tree of over 100,000 records stored in MySQL using lft, rght and parent_id columns. Now the left/right values became corrupted, while the parent ids are still intact. It would require tons of queries to repair it in the application layer. Is there a good way to put the burden on the database and have it recalculate the left/right values using only SQL?
I have your run of the mill nested set hierarchy type setup with the following columns:
I’m working with nested sets for my CMS but since MySQL 5.5 I can’t move a node.
The following error gets thrown:
I have hierarchical data in a nested set model (table:projects):
I am trying to get my data which is hierarchically set up with a tree traversal model into an < ul> in order to show on my site.
