From: | Jean-Paul Argudo <jean-paul(at)argudo(dot)org> |
---|---|
To: | Daniel Caune <daniel(dot)caune(at)ubisoft(dot)com> |
Cc: | Michael Fuhr <mike(at)fuhr(dot)org>, lucius(dot)seneca(at)gmail(dot)com, postgresql sql list <pgsql-sql(at)postgresql(dot)org> |
Subject: | Re: connectby documentation |
Date: | 2006-03-14 11:45:37 |
Message-ID: | 4416ACE1.5040207@argudo.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
Daniel Caune a écrit :
> Wow, that was the quest for the Holy Grail! :-)
Yes I understand. That kind of documentation for a
contrib-addon-whatever for PostgreSQL can be tricky sometimes to find..
I just jump on that thread to place a reminder for all those wanting to
implement trees in databases, just in case they are still thinking about
howto do that.
I wroted an article on that topic (in french only sorry :
http://www.postgresqlfr.org/?q=node/142) where I compare id/parent_id,
nested loops and Miguel Sofer's method.
This method is explained on OpenACS forums (in english)
http://openacs.org/forums/message-view?message_id=18365
The original work of Miguel Sofer (with a PostgreSQL implementation as
an example) can be found here:
http://www.utdt.edu/~mig/sql-trees/
Be sure to download the tar.gz. on the like "here"... and read his draft.
I'm really convinced this method is the best so far. I used it in 3
different projects where I had to implement big trees structures on a
table. They all still work with no problem of any kind.
Just to let you know in case you missed that ;-)
My 2 ¢
--
Jean-Paul Argudo
www.Argudo.org
www.PostgreSQLFr.org
From | Date | Subject | |
---|---|---|---|
Next Message | Achilleus Mantzios | 2006-03-14 13:30:11 | Re: connectby documentation |
Previous Message | John Sidney-Woollett | 2006-03-14 07:56:31 | Re: Update value to "the first character is capital and |