> What I'd like to see it do is grab the dependency data in pg_depend and > do a topological sort using that.
At the end though, we'd need to dump stuff not caught be the topsort, for cases where pg_depend has been messed with.
I have made a start of this (months ago), but have not had a chance to get back to it. I you are interested I can send my design plans etc. Or I could try to get back to it, depending on how interested you are in doing the work.
In terms of the dependency data, I was planning to dump dependencies as well (a trivial skeleton exists); the ordering should happen at restore-time (except dump should store it in useful-order on the assumption that it will not be possible to re-order at restore-time). This is important since we need to allow requests like:
"restore table xyz and it's dependencies from a full dump"
---------------------------------------------------------------- Philip Warner | __---_____ Albatross Consulting Pty. Ltd. |----/ - \ (A.B.N. 75 008 659 498) | /(@) ______---_ Tel: (+61) 0500 83 82 81 | _________ \ Fax: (+61) 03 5330 3172 | ___________ | Http://www.rhyme.com.au | / \| | --________-- PGP key available upon request, | / and from pgp5.ai.mit.edu:11371 |/
---------------------------(end of broadcast)--------------------------- TIP 4: Don't 'kill -9' the postmaster
