| From: | Gregory Stark <stark(at)enterprisedb(dot)com> |
|---|---|
| To: | "paul(dot)dorman" <paul(dot)dorman(at)gmail(dot)com> |
| Cc: | <pgsql-general(at)postgresql(dot)org> |
| Subject: | Re: DAGs and recursive queries |
| Date: | 2007-09-26 15:54:47 |
| Message-ID: | 87bqbpbewo.fsf@oxford.xeocode.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
"paul.dorman" <paul(dot)dorman(at)gmail(dot)com> writes:
> Hi everyone,
>
> I would like to know the best way to implement a DAG in PostgreSQL. I
> understand there has been some talk of recursive queries, and I'm
> wondering if there has been much progress on this.
The ANSI recursive queries didn't make it into 8.3. I still hope it makes 8.4.
You could check out the tablefunc contrib which includes a function called
connectby() which implements a kind of recursive query.
Alternatively you might look at the ltree contrib module but that doesn't work
the way you describe. It denormalizes the data for very fast but less flexible
operations.
--
Gregory Stark
EnterpriseDB http://www.enterprisedb.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2007-09-26 16:20:52 | Re: Help tuning a large table off disk and into RAM |
| Previous Message | David Siebert | 2007-09-26 15:47:24 | More on migragting the server. |