Tom Lane wrote: > Greg Stark <[EMAIL PROTECTED]> writes: > > I'm not clear that building from WAL is really going to be that much faster. > > A) algorithmically it's only the factor of log(n) that you're talking about. > > and B) the WAL will have records for every write, not just the final product, > > so it might potentially have a lot more writes to do. > > Wrong ... what we log in WAL for a btree index build is just the series > of completed index page images. Recreation of the index would proceed > at whatever your disk read/write bandwidth is. > > Like Alvaro, I suspect that people who are using PITR will be concerned > about recovery time, and would not be thrilled with any scenario that > involves REINDEX to get the system back on its feet.
Agreed. -- Bruce Momjian | http://candle.pha.pa.us [EMAIL PROTECTED] | (610) 359-1001 + If your life is a hard drive, | 13 Roberts Road + Christ can be your backup. | Newtown Square, Pennsylvania 19073 ---------------------------(end of broadcast)--------------------------- TIP 2: you can get off all lists at once with the unregister command (send "unregister YourEmailAddressHere" to [EMAIL PROTECTED])
