yuanjia lee <[EMAIL PROTECTED]> writes:
> The algorithm of searching the WAL is like this:
> 1. Read name of the segment files from xlog directory, and put all of
> their name into an one way list, the list is descending according to the time
> line, xlog id, segement id. (Athough I use only the lastest file in the
> implementation, but the list can be used for the feature like dump log in
> future.)
You do realize that in most situations, the segment files with the
newest-looking names have not been used yet, and contain older rather
than newer data?
When multiple timelines are present, I'm not sure I care for the
heuristic "use the highest timeline number", either.
regards, tom lane
---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
