I have a set of data that’s organized hierarchically that should be able to grow to an arbitrary size. I need to retrieve the entire tree, but I can’t figure out how to do it with just SQL. My current solution is to create a temporary table and use a recursive function to successively query branches of the tree and then store the result in the temporary table which I subsequently query again to produce my desired result.
My question is, what I’m doing is essentially what a join does correct? Constructing an intermediate table and then querying over the results. It seems like there should be a way to do it with joins, but the MySQL documentation only covers retrieving parts of a tree up to finite depth. Is there a way to do this? I’m doing this in PHP.
MySQL doesn’t support recursive queries.
I would suggest that you look at Bill Karwin’s presentation where he compares four different models for storing heirarchical data and looks at their pros and cons:
Slide 48 shows the relative difficulty of certain types of queries with each of the models. From your question it sounds like you are interested most in “Query subtree”, for which the adjacency list (the model you are currently using) performs the most poorly of the four.
Alternatively if you just want to select the entire tree, as in all data in the table, then you could use the simple query
SELECT * FROM yourtableand reconstruct the tree structure in the client.