| From: | Bruno Wolff III <bruno(at)wolff(dot)to> |
|---|---|
| To: | Chris Smith <cdsmith(at)twu(dot)net> |
| Cc: | pgsql-general(at)postgresql(dot)org |
| Subject: | Re: Computing transitive closure of a table |
| Date: | 2006-06-19 20:20:10 |
| Message-ID: | 20060619202010.GA29333@wolff.to |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
On Mon, Jun 19, 2006 at 13:43:17 -0600,
Chris Smith <cdsmith(at)twu(dot)net> wrote:
> I am doing some preliminary work on the next major release of a piece of
> software that uses PostgreSQL. As odd as this sounds, it seems that a huge
> percentage of the new features that have been requested involve computing
> the transitive closure of a binary relation that's expressed in a database
> table.
I believe this is covered by the following on the TODO list:
Add SQL:2003 WITH RECURSIVE (hierarchical) queries to SELECT
I think someone did some work on this a while ago, but that not much has
happened recently.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Scott Marlowe | 2006-06-19 20:24:57 | Re: Adding foreign key constraints without integrity |
| Previous Message | Oleg Bartunov | 2006-06-19 19:58:41 | Re: Computing transitive closure of a table |