From: alet@unice.fr
To: pgsql-sql@postgresql.org
Subject: Help with a "recursive" query
Date: Wed, 19 Jun 2002 09:30:21 +0200
Message-ID: <20020619073021.GA2374@port50-2.unice.fr> (raw)
Hi,
I've got a table like this :
id parent description
01 00 xxxxxx
02 00 xxxxxx
03 01 xxxxxx
04 02 xxxxxx
05 01 xxxxxx
06 05 xxxxxx
07 03 xxxxxx
08 07 xxxxxx
09 00 xxxxxx
10 02 xxxxxx
I want to get all tuples which have id=01 as their parent
or ancestor, i.e. :
03, 05, 06, 07, 08
this to represent a sort of n-tree :
01
/ \
/ \
/ \
03 05
/ \
/ \
/ \
07 06
|
|
|
08
this example is simple because each node has at most one child, but in
my real data there's no such limit.
any idea ?
thanks in advance
Jerome Alet
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-sql@postgresql.org
Cc: alet@unice.fr
Subject: Re: Help with a "recursive" query
In-Reply-To: <20020619073021.GA2374@port50-2.unice.fr>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox