butter
> use case, i.e. high availability. My guess is I'm misunderstanding what you
> are saying.
> -Ryan
>
>
>
> On Thu, Jun 9, 2011 at 8:00 PM, Ben Tilly wrote:
>>
>> I am not a developer advocate. But my top hate is that when machines
>> leave/rejoi
I am not a developer advocate. But my top hate is that when machines
leave/rejoin your data can be inaccessable for some time.
We had a great case where we wanted to use Riak, but that was a
complete showstopper and we won't be using it because of that. (We
wanted to store information which need
Google uses http://code.google.com/p/snappy/ internally for exactly this
sort of thing. There is an Erlang binding available.
On Sun, May 29, 2011 at 12:13 AM, Malka Feldman wrote:
> Hi,
> I get long strings from my map functions, I want to get much smaller
> responses to reduce the latency, Do
I would strongly advise you that mobile clients should not be trusted to
access your data directly. Because someone *will* reverse engineer them,
and *will* see what they can see. You really do need an API between your
mobile application and the mobile service.
I know you think you don't. You'r
Performance is fine. However requests get a "not found" response for an
extended period of time. See
http://lists.basho.com/pipermail/riak-users_lists.basho.com/2011-May/thread.html#4078for
previous discussion of what sounds like the same issue.
On Thu, May 26, 2011 at 6:57 AM, Jonathan Langevin
Here is my understanding. Corrections welcome.
You're missing that Riak is happy to be "eventually consistent". Drop
out 2 of your nodes, and it rebalances who is responsible for what,
then under the hood migrates and replicates its data more leisurely.
Data is still being written to 4 differen
In JavaScript the default sort order depends on the data types of the
variables in question. If either is a string, you convert the other
to a string and sort lexicographically, but if both are numbers you
compare numerically. There is a similar inconsistency around what the
"+" operation does.
There are solutions to that consistency issue. You can set
allow_multi true, have each object have a link to a change history,
and have each change have a record of what changed. The change
history could be done as a singly linked list, where each change is
inserted into a bucket with a randomly
On Thu, May 5, 2011 at 1:06 PM, Andy Gross wrote:
>
> Alex's description roughly matches up with some of our plans to address this
> issue.
> As with almost anything, this comes down to a tradeoff between consistency
> and availability. In the case of joining nodes, making the
> join/handoff/own
es it down, fails over to a second
one, takes that down as well.) If data has been replicated 5 times,
is Riak likely to survive somewhat gracefully?
On Thu, May 5, 2011 at 12:03 PM, Ben Tilly wrote:
> OK, I've been sitting here watching this thread, and I'd really like
> to understan
OK, I've been sitting here watching this thread, and I'd really like
to understand what happens when a node leaves/joins. I can't find any
really good documents describing it. Based on the conversation as
I've followed it, here is a detailed description of my garbled
misunderstanding. Please cor
Riak's design explicitly falls into the AP corner of the widely cited
CAP Theorem. This means that it gives up consistency. The scenario
that you are asking about involves consistency in a deep way, and so
is tricky to do with Riak.
Your life will be much easier if you visit
http://blog.nahurst.
t; written objects are used to represent the history of a single conceptual
> "object". Once written, nothing is overwritten, only new objects are created.
>
> Sean Cribbs
> Developer Advocate
> Basho Technologies, Inc.
> http://basho.com/
>
> On Apr 18, 2011, at 10:46
e is that multiple,
>> independently written objects are used to represent the history of a single
>> conceptual "object". Once written, nothing is overwritten, only new objects
>> are created.
>>
>> Sean Cribbs
>> Developer Advocate
>> Bas
stor is going
> to give you if you don't have the value. Vector clocks are essentially
> opaque to clients.
>
> That said, I think the use-case you gave is one that can clearly bubble up to
> the user, e.g. "Someone else changed this record while you were editing it.
Riak's small_vclock, big_vclock, young_vclock, and old_vclock
parameters already give control over pruning behavior. If there isn't
enough history to compute a common ancestor, then return nothing for
the common ancestor.
The use case here really isn't an SCM. The use case is when two
clients ge
On Mon, Apr 18, 2011 at 4:59 PM, Dan Reverri wrote:
> Hi Bryan,
> This is an excellent question and one of the more difficult areas of Riak to
> understand. The source of confusion in this situation is vector clocks. Riak
> maintains a vector clock for every object which is used to track different
On Mon, Apr 18, 2011 at 3:12 PM, Jon Brisbin wrote:
>
> On Apr 18, 2011, at 2:47 PM, Ben Tilly wrote:
>
>> The first is that I've heard that there is a limit to the size of the
>> headers that can be sent using the http interface and therefore the
>> number of
The first is that I've heard that there is a limit to the size of the
headers that can be sent using the http interface and therefore the
number of links that you can use. Is this true, and if so does anyone
know what the limit is?
My second question is this. It seems that if accesses are config
19 matches
Mail list logo
