Message-ID: <4416ACE1.5040207@argudo.org>
Date: Tue, 14 Mar 2006 12:45:37 +0100
From: Jean-Paul Argudo <jean-paul@argudo.org>
User-Agent: Mozilla Thunderbird 1.0.7 (X11/20051017)
MIME-Version: 1.0
To: Daniel Caune <daniel.caune@ubisoft.com>
Cc: Michael Fuhr <mike@fuhr.org>, lucius.seneca@gmail.com,
	postgresql sql list <pgsql-sql@postgresql.org>
Subject: Re: connectby documentation
References: <1E293D3FF63A3740B10AD5AAD88535D201C6B1BF@UBIMAIL1.ubisoft.org>
In-Reply-To: <1E293D3FF63A3740B10AD5AAD88535D201C6B1BF@UBIMAIL1.ubisoft.org>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit

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