> On Nov 29, 2016, at 9:09 AM, Simon Slavin <slav...@bigfraud.org> wrote: > > You cannot design a system which (A) provides up-to-date data to readers (B) > allows writers to get rid of their data immediately without ever locking up > and (C) guarantees that earlier changes to the data are ’saved' before later > changes, thus preserving uncorrupted data in the case of power-cuts, etc..
In the general case of multiple writers I would agree, but I think Mark said he’s only got one writer. (Or at least the problem he described is independent of the number of writers.) And the problem he’s describing is not one of correctness but of performance, i.e. optimizing file size by checkpointing the WAL. > You might like to read more about Brewer’s Theorem: > <https://en.wikipedia.org/wiki/CAP_theorem> The CAP theorem applies to distributed systems; I don’t see how it’s relevant here? —Jens _______________________________________________ sqlite-users mailing list sqlite-users@mailinglists.sqlite.org http://mailinglists.sqlite.org/cgi-bin/mailman/listinfo/sqlite-users
