Skip site navigation (1) Skip section navigation (2)

Re: pg_depend explained

From: Joel Jacobson <joel(at)gluefinance(dot)com>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: Alvaro Herrera <alvherre(at)commandprompt(dot)com>, Florian Pflug <fgp(at)phlo(dot)org>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: pg_depend explained
Date: 2011-01-12 17:33:31
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-hackers
2011/1/12 Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>:
> This isn't particularly *useful*, maybe, but it's hardly "impossible".
> And if we analyzed function dependencies in any detail, circular
> dependencies among functions would be possible (and useful).

Thanks Tom for clarifying, this makes me even more motivated into
implementing the "creation order"-algorithm using only sql/plpgsql and
If you have any ideas on how to do this, in addition to reading the
dependency.c and pg_dump_sort.c source code, they would be highly

Any tips on articles on graph algorithms which not only take edges
(node->node) as indata, but also a "edge type" as indata (i.e. the
deptype in pg_depend) would also be very useful. I have only found
algorithms to do sorting on "normal" directional graphs, where all
edges are threated the same.

Best regards,

Joel Jacobson
Glue Finance

In response to


pgsql-hackers by date

Next:From: Stephen FrostDate: 2011-01-12 17:37:15
Subject: Re: Add support for logging the current role
Previous:From: Robert HaasDate: 2011-01-12 17:26:08
Subject: Re: Add support for logging the current role

Privacy Policy | About PostgreSQL
Copyright © 1996-2017 The PostgreSQL Global Development Group