I'm not sure what you mean by "assuming the vclock entries are 1-1 with the siblings". That sounds rather like a misunderstanding of either what the vclock is, or of how the vclock is stored in the case of siblings. (As for the latter, only the merged vclock is stored for the entire key/value-pair; the length of that vclock is unrelated to the number of siblings.)
Mobile: + 45 2636 1755 | Skype: eriksoesorensen | Twitter: @eriksoe Trifork A/S | Margrethepladsen 4 | DK- 8000 Aarhus C | Phone : +45 8732 8787 | www.trifork.com ________________________________________ From: [email protected] [[email protected]] On Behalf Of Michael Radford [[email protected]] Sent: 24 March 2012 19:24 To: [email protected] Subject: order of siblings Is there a way to determine what Riak thinks is the last-written sibling (or one of them), when reading from Riak with allow_mult=true (via the erlang protobufs api)? I'm writing some conflict resolution code, which in many cases should fall back to the default strategy of last-writer-wins, and it would be nice to use Riak's default ordering instead of embedding an extra timestamp in the value. It looks like something like the unpacking of the vclock here might work: https://gist.github.com/1380896 ...assuming the vclock entries are 1-1 with the siblings, but that's not clear to me. Or maybe the siblings already come in a particular order, oldest or newest first? Thanks, Mike _______________________________________________ riak-users mailing list [email protected] http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com _______________________________________________ riak-users mailing list [email protected] http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
