I know this question has been discussed, probably multiple times, but I
can't seem to access archives.postgresql.org today....
I need to select all the rows in a table with two fields: parent_id and
child_id that participate in the same logical "tree". In other words,
given an id value, I want to find where child_id = my-value, and then
retrieve the values in the tree above it.
The functionality I'm looking for is essentially the Oracle "connect
by". Does anything like this exist for postgresql? If not, does anybody
have a clever solution? (My not-so-clever first pass involved recursing
in my Java program, but the stack-space-abuse police are knocking on my
Again, apologies for asking something that's probably already been
discussed ad nauseum on this list...
David Parker Tazz Networks (401) 709-5130
pgsql-general by date
|Next:||From: Tom Lane||Date: 2004-08-30 20:54:46|
|Subject: Re: aggregates with complex type as state and init condition |
|Previous:||From: Thomas Chille||Date: 2004-08-30 19:20:14|
|Subject: aggregates with complex type as state and init condition|