From: Rajesh Kumar Mallah <mallah@trade-india.com>
Organization: Infocom Network Limited
To: =?iso-8859-1?q?Beno=EEt=20Bournon?= <benoit.bournon@adelis.com>,
	pgsql-sql@postgresql.org
Subject: Re: Recursive request ...
Date: Sun, 13 Jul 2003 12:17:02 +0530
User-Agent: KMail/1.5.1
References: <3F0C3469.2050106@adelis.com>
In-Reply-To: <3F0C3469.2050106@adelis.com>
MIME-Version: 1.0
Content-Type: text/plain;
  charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
Content-Disposition: inline
Message-Id: <200307131217.02856.mallah@trade-india.com>


Dear Bournon,

There are already good implementation of Tree
structures in databases ranging from using pure SQL
to PostgreSQL specfic methods , less point in=20
revinting wheel unless u really need.

Some Pointers:

"Tree-structure functions"
http://www.brasileiro.net:8080/postgres/cookbook/


Gist Based:
contrib/ltree


Joe Celko's Article on "Nested Sets & Adjacency Lists"

http://www.ibase.ru/devinfo/DBMSTrees/sqltrees.html
http://users.starpower.net/rjhalljr/Serve/MySQL/traer.html
http://www.google.com/search?hl=3Den&ie=3DUTF-8&oe=3DUTF-8&q=3Dadjacency+li=
st+%2B+tree+%2B+joe


On Wednesday 09 Jul 2003 8:57 pm, Beno=EEt Bournon wrote:
> I have to make a function that returns a tree with title and link of a
> table.
>
> Recursively, a information depends on a parent information.
>
> It is to organise a menu with parent dependance.
>
> How is it possible and faster  ? in C ? pl/pgsql or other ?
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Don't 'kill -9' the postmaster