Hi I have parent child relationship set up where I can use
select node * from Tree
left join fetch Tree.child
where node.id = :id

I want to know if their is a code to actually also include the parent node along with all the child node include children's children's children... to because union is not supported. Is their a work around this, I want avoid using pure sql-query if possible.

Yes you can. I guess u are storing both the parent and the child in the same table with the child holding a reference to the parent id. In that case you can use a set in the mapping

Example:



The above mapping says a class tree contains a collection of Tree objects.

So all you have to do to retrieve the entire tree to how many ever levels is a simple hql or a simple load by Id

Your code will be



It will return to u an array list of Tree object with id = 1. You can then get each of the tree objects within which you will have a Set of Tree objects that are its children.

sorry thats not what i meant.


lets say childX, contains child1 and child2.
childY, contains child3 and child 4.

parentNode.add(node1);
parentNode.add(node2);

parentNote.getchild should print childX, childY, child1, child2, child3, child4. in a set.

It should not return a set of set rather just single collection of all object.

I don't think it can work that way. And I feel its wrong to do that too. You are trying to change the object relationship itself. Ofcourse, you can use hql or native sql to do this. But you said you wanted to avoid it.