I'd like to see the dotted version vectors get launched, even with merging
siblings high concurrency = high amount of unnecessary siblings,
Which wastes space and impacts performance. Dotted version vectors helps
improve this. Proof of concept and paper available...
On Oct 7, 2013 3:06 PM, "Sam Ell
As Steve said, this package is for 10.8+. If you would like to build from
source, you can follow the instructions here:
http://docs.basho.com/riak/latest/ops/building/installing/from-source/ If
you would like to build a package to use on other machines, follow the same
instructions, except call
As indicated in the URL for the tarball you downloaded, Riak 1.4.2 for OS X
was built for 10.8.x, but you're running 10.7.5 so that build won't work
there.
--steve
On Mon, Oct 7, 2013 at 7:34 PM, Arun Gupta wrote:
> Downloaded Riak 1.4.2 from:
>
>
> http://s3.amazonaws.com/downloads.basho.com/
Downloaded Riak 1.4.2 from:
http://s3.amazonaws.com/downloads.basho.com/riak/1.4/1.4.2/osx/10.8/riak-1.4.2-OSX-x86_64.tar.gz
Starting Riak as bin/riak gives the error:
Error reading /Users/arungup/tools/nosql/riak/riak-1.4.2/bin/../etc/app.config
And then a dialog box pops up with the following
Hi Brady,
The 2I indices are written in the same store as the main objects whenever
the main object is updated. If a primary node is down, the indices will be
written to a fallback node. When the fallback sees the primary come back
online and stops receiving requests for that partition it will s
What happens to your 2i indexes if you do a write and one of the nodes
you're trying to write to is down?
http://docs.basho.com/riak/latest/dev/using/2i/ says:
- When you want or need anti-entropy. Since 2i is just metadata on the
KV object and the indexes reside on the same node, 2i piggy
I tested that with curl. Should've mentioned that.
The output shows there is no siblings for the key and returned header looks
like this:
< HTTP/1.1 200 OK
< X-Riak-Vclock:
a85hYGBgymDKBVIc84WrPgUFPS3IYEpkymNlWJZ4/DQfVIpNStsDKsUIlFoOksoCAA==
< x-riak-index-oid_bin: 2a9691be-2f70-11e3-b746-c91c3800
I was about to add something similar :)
There is CRDT support present in the develop branch of CorrugatedIron, that
operates at a relatively low level - you're left to construct the
operations yourself. The current API works great for things like friends
lists but it's rough for something like mod
Daniel -
Unfortunately returning the body from a store operation may not
reflect all the replicas (and in the case of a concurrent write on two
different nodes "may not" really means "probably doesn't").
If you do a subsequent fetch after sending both your writes you'll get
back a single vclock
Each sibling has it's own last-modified date, which you should be able to use
to sort them when you get them back.
However, I'd suggest the following: if they're siblings, they were created from
concurrent edits. Thus, create a merge function that is entirely deterministic
without using the ti
Yeah so it seems oldest/newest is a flawed notion I have to get over!
Siblings are so *ZEN* :)
On Mon, Oct 7, 2013 at 12:47 PM, Alex Rice wrote:
> Yes, exactly that's what I'm working on. By knowing which sibling is
> the oldest and which is the newest it seems like I can usually figure
> out how
Yes, exactly that's what I'm working on. By knowing which sibling is
the oldest and which is the newest it seems like I can usually figure
out how to marge/apply the modifications. Things like Player profiles,
friends lists, etc.
On Mon, Oct 7, 2013 at 12:43 PM, Jeremiah Peschka
wrote:
> There's
There's no guarantee of return order as far as I know. Since you can't
count on clocks anyway...
Are you trying to determine which data modifications to apply from multiple
siblings?
---
sent from a tiny portion of the hive mind...
in this case, a phone
On Oct 7, 2013 11:40 AM, "Alex Rice" wrote
Hi Brian
Thanks for update.
I'm using 1.1.3 now and still have some issues sibling related
Two clients are updating the same key.
Updated is my custom meta field, which should be merged to contain values
from both clients (set)
I see both client are doing fetch, resolving sibling (only 1 i.e. no
Are they ordered by timestamp, and is the ordering guaranteed? (within
the clock accuracy of course). Using the C# client Thanks,
Alex
___
riak-users mailing list
riak-users@lists.basho.com
http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.c
On Mon, Oct 7, 2013 at 12:18 PM, Julio Cesar Ríos Gutierrez <
jctau...@gmail.com> wrote:
>
> I had stored object in first place, but now I want to link to another
> object, and At this phase, It got an error when, I try to get metatada:
> {ok, RiakObj} = riakc_pb_socket:get(RiakPid, Bucket, Key),
Hello.
I have a little problem with Riak. I have wrote Riak-client script via Erlang.
My code here:
-- Code --
%% @doc Method to get object by bucket and key
get_object(Bucket, Key)->
do_get_request(lists:concat(["/buckets/",binary_to_list(Bucket),
I had stored object in first place, but now I want to link to another
object, and At this phase, It got an error when, I try to get metatada:
{ok, RiakObj} = riakc_pb_socket:get(RiakPid, Bucket, Key),
Meta = riakc_object:get_metadata( RiakObj )
this is the error:
_Reason = {undef,
Hi!
I'm trying to run custom erlang-written map/reduce and get this error:
There was an error in processing a map or reduce function :
500 Internal Server
ErrorInternal Server ErrorThe server
encountered an error while processing this request:
{error,{error,function_clause,
[{chashb
19 matches
Mail list logo
