Hi!
I know I'm butting in and I'll admit I can't follow exactly what the
discussion has been, but it seems (to me at least) to be related to an
article I recently read (following a link on Mark Pilgrim's site
diveintomark.org:
Storing Hierarchical Data in a Database by Gijs Van Tulder
<http://www.sitepoint.com/article/1105/1>
The further readings suggested at the end of the article were helpful
to me as well.
If it's not helpful, sorry for the interruption! I'll go back to
lurking now.
Michael Glaesemann
grzm myrealbox com
On Saturday, Jun 28, 2003, at 08:40 Asia/Tokyo, Nabil Sayegh wrote:
> Am Sam, 2003-06-28 um 01.26 schrieb Joe Conway:
>> Nabil Sayegh wrote:
>>> What would yout think about a function that ascends a tree from a
>>> given
>>> node to the topmost and returns the path as a table ?
>>>
>>
>> Not sure I understand what you're proposing correctly, but can't you
>> just reverse the parent/child id fields?
>
> Hm, Eh, yup, that helped :)
>
> thx
>
> P.S: That should go into the README
> --
> e-Trolley Sayegh & John, Nabil Sayegh
> Tel.: 0700 etrolley /// 0700 38765539
> Fax.: +49 69 8299381-8
> PGP : http://www.e-trolley.de
>
>
> ---------------------------(end of
> broadcast)---------------------------
> TIP 8: explain analyze is your friend
>
>
