On 27 September 2010 09:56, Reto Bachmann-Gmuer <[email protected]> wrote:
Just thought on this: > *Performance* > On read access apart from the base-graph a set of patches has to be checked, > both for additions and removals of triples. As under normal circumstances > the umber of patches should be relatively small this shouldn't be too bad. > Write operations should get significantly faster as generating and adding a > patch does not require a qrite lock on the base graph. Seems the kind of place it might be useful for there to be flags that can be set for reading: 1 : state without any pending patches - fast but possibly stale 2 : state including patches from transactions in progress - fast but possibly inconsistent (client assumes "eventually consistent") 3 : state with all queued patches - slower but up-to-date & consistent No idea what this might look like in implementation. Cheers, Danny. -- http://danny.ayers.name
