| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Nested Sets Insertion
>> Can we use another approach for such tree problems? <<
Oh yes! Tropashko pointed out that any partial ordering can be used to give us (x,y) pairs that locate the roots of subtrees. I will be using his work for a chapter in my next book, TREES & HIERARCHIES IN SQL. I hope to have it in print before the end of the year. Received on Tue May 13 2003 - 17:39:59 CDT
![]() |
![]() |