don't see size
>> being an issue. I have also considered using a counter to know how large an
>> object is without fetching it, which shouldn't be off by more than a few
>> siblings unless there is a network partition.
>> >>>
>> >>> So asi
ich shouldn't be off by more than a few
> siblings unless there is a network partition.
> >>>
> >>> So aside from size issues, which can be roughly predicted or worked
> around, is there any reason to not create hundreds or thousands of siblings
> and resolve t
>> resolve them later? I realise sets could work well for my use case, but
>>> they seem overkill for simple append operations when I don't need delete
>>> functionality. Creating your own CRDTs are trivial if you never need to
>>> delete.
>>>
>>
case, but they
>> seem overkill for simple append operations when I don't need delete
>> functionality. Creating your own CRDTs are trivial if you never need to
>> delete.
>>
>> Thoughts are welcome,
>> Jason
>> From: John Daily
>> Sent: Wedn
ality. Creating your own CRDTs are trivial if you never need to
> delete.
>
> Thoughts are welcome,
> Jason
> From: John Daily
> Sent: Wednesday, 13 November 2013 3:10 AM
> To: Olav Frengstad
> Cc: riak-users
> Subject: Re: Forcing Siblings to Occur
>
> Forcing sibl
ted or worked
> > > > around, is there any reason to not create hundreds or thousands of
> > > > siblings and resolve them later? I realise sets could work well for my
> > > > use case, but they seem overkill for simple append operations when I
> > >
append operations when I don't need delete
>> functionality. Creating your own CRDTs are trivial if you never need to
>> delete.
>>
>> Thoughts are welcome,
>> Jason
>>*From: *John Daily
>> *Sent: *Wednesday, 13 November 2013 3:10 AM
>> *To: *Olav
't need delete
> functionality. Creating your own CRDTs are trivial if you never need to
> delete.
>
> Thoughts are welcome,
> Jason
> *From: *John Daily
> *Sent: *Wednesday, 13 November 2013 3:10 AM
> *To: *Olav Frengstad
> *Cc: *riak-users
> *Subject: *Re: Forci
r my use case, but they
> seem overkill for simple append operations when I don't need delete
> functionality. Creating your own CRDTs are trivial if you never need to
> delete.
>
> Thoughts are welcome,
> Jason
> From: John Daily
> Sent: Wednesday, 13 November 2013
I am currently forcing siblings for time series data. The maximum bucket sizes are very predictable due to the nature of the data. I originally used the get/update/set cycle, but as I approach the end of the interval, reading and writing 1MB+ objects at a high frequency kills network bandwidth. So
Forcing siblings other than for testing purposes is not typically a good idea;
as you indicate, the object size can easily become a problem as all siblings
will live inside the same Riak value.
Your counter-example sounds a lot like a use case for server-side CRDTs; data
structures that allow t
Do you consider forcing siblings a good idea? I would like to get some
input on possible use cases and pitfalls.
For instance i have considered to force siblings and then merge them on
read instead of fetching an object every time i want to update it
(especially with larger objects).
It's not clea
On Fri, Nov 8, 2013 at 11:38 AM, Russell Brown wrote:
> If you’re using a well behaved client like the Riak-Java-Client, or any other
> that gets a vclock before doing a put, use whatever option stops that.
for (int i = 0; i < numReplicasWanted; i++) {
bucket.store("key", "value").withoutFe
Hi Mark,
It is pretty easy.
Set your bucket to allow_mult=true.
Send a put to bucket, key.
Send another one to the same bucket key.
If you’re using a well behaved client like the Riak-Java-Client, or any other
that gets a vclock before doing a put, use whatever option stops that.
With the pb c
Updating any key without supplying a vector clock is guaranteed to create a
sibling.
-John
On Nov 8, 2013, at 1:29 PM, Mark A. Basil, Jr. wrote:
> Is there some method that is either guaranteed or very highly likely to
> create Siblings of an object (that isn’t a counter)? I would like to ha
Is there some method that is either guaranteed or very highly likely to
create Siblings of an object (that isn't a counter)? I would like to have a
reliable method to test code which is meant to handle them.
___
riak-users mailing list
riak-users@lists.
16 matches
Mail list logo
