From: | Bruce Momjian <maillist(at)candle(dot)pha(dot)pa(dot)us> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | "Ross J(dot) Reedstrom" <reedstrm(at)wallace(dot)ece(dot)rice(dot)edu>, pgsql-hackers(at)postgreSQL(dot)org |
Subject: | Re: [HACKERS] pg_dump table order |
Date: | 1999-09-13 15:35:53 |
Message-ID: | 199909131535.LAA17272@candle.pha.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
> Better idea: make pg_dump smarter, so that it sorts the tables by name
> as far as possible without breaking inheritance and membership
> dependencies. It already retrieves the inheritance graph, and it could
> certainly figure column-type dependencies too. I don't think anyone
> would object to producing the output in a more meaningful order, so
> I see no need for a switch if you can make this work.
>
> I used to know enough about topological sorts to sketch how this ought
> to work, but that was years ago :-(. I do see that the simplest
> approach to a sort comparison function, "if a depends on b then say a>b,
> else say result of comparing name(a) and name(b)", will not work because
> it's not transitive.
I now someone fixed some of that recently, and I thought it was in 6.5.
--
Bruce Momjian | http://www.op.net/~candle
maillist(at)candle(dot)pha(dot)pa(dot)us | (610) 853-3000
+ If your life is a hard drive, | 830 Blythe Avenue
+ Christ can be your backup. | Drexel Hill, Pennsylvania 19026
From | Date | Subject | |
---|---|---|---|
Next Message | Ansley, Michael | 1999-09-13 15:46:48 | RE: [HACKERS] Status report: long-query-string changes |
Previous Message | Bruce Momjian | 1999-09-13 15:16:25 | Re: [HACKERS] Status report: long-query-string changes |