Ye' old general discussion board. Basically, for everything that isn't covered elsewhere. Come here to shoot the breeze, shoot your mouth off, or whatever suits your fancy. This forum is not for asking programming related questions.
The result is certainly a tree structure but the implementation is relational so I wonder if it qualifies, if so, which one?
In storing ID's as opposed to pointers to other nodes, and the fact traversal of child nodes requires a different SQL statement than moving backwards somehow disqualify the technique as as of the above data structures.
In this sense it is more akin to a singly linked list as only the parent ID is stored in each node, however forward traversal is possible thanks to the power of SQL.