From: | Dmitry Samersoff <dms(at)wplus(dot)net> |
---|---|
To: | Bruce Momjian <maillist(at)candle(dot)pha(dot)pa(dot)us> |
Cc: | pgsql-hackers(at)postgreSQL(dot)org, "Ross J(dot) Reedstrom" <reedstrm(at)wallace(dot)ece(dot)rice(dot)edu>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Subject: | Re: [HACKERS] pg_dump table order |
Date: | 1999-09-13 17:31:35 |
Message-ID: | XFMail.990913213135.dms@wplus.net |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 13-Sep-99 Bruce Momjian wrote:
>> 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.
Unfortunately not, if I use some functions in CONSTRANE clause of
CREATE TABLE, I can't restore from backup made by pg_dump.
It's nice idea always dump functions first.
---
Dmitry Samersoff, dms(at)wplus(dot)net, ICQ:3161705
http://devnull.wplus.net
* There will come soft rains ...
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 1999-09-13 17:36:07 | Re: [HACKERS] HISTORY for 6.5.2 |
Previous Message | Bruce Momjian | 1999-09-13 17:11:11 | Re: HISTORY for 6.5.2 |