2011/1/11 Florian Pflug <fgp(at)phlo(dot)org>:
> Could you give an example of the kind of trouble you're experiencing trying
> to use a topological sort?
Let's say you have a table t and a view v.
The view v is defined as select * from t;
If we put all objects in a tree, with the public schema as the root,
both v and t will directly under the root, but in reality, v cannot be
created before t.
This is the reason why a normal topological sort doesn't work.
You have to look at the deptype and sort nodes having "internal" edges
between them differently.
The pg_dump source code of course contains all the logic necessary to
do the trick, but it's not that easy to follow.
I guess it's time for plan B, sorting based on oid, no biggie, it will
work for my purpose, but it's damn ugly.
In response to
pgsql-hackers by date
|Next:||From: Peter Eisentraut||Date: 2011-01-11 23:06:58|
|Subject: pg_regress multibyte setting|
|Previous:||From: Lukas Eder||Date: 2011-01-11 22:54:19|
|Subject: Re: Fwd: Weird issues when reading UDT from stored function|