(An earlier post seems not to have gone through. My apologies in the eventual
case of a duplicate.)
I'm thinking of using Riak to replace a large Oracle system, and I'm trying to
understand its guarantees. I have a few introductory questions; this is the
first of three.
I'm trying to understan
(An earlier post seems not to have gone through. My apologies in the eventual
case of a duplicate.)
I'm thinking of using Riak to replace a large Oracle system, and I'm trying to
understand its guarantees. I have a few introductory questions; this is the
second of three.
Imagine I do a write,
(An earlier post seems not to have gone through. My apologies in the eventual
case of a duplicate.)
I'm thinking of using Riak to replace a large Oracle system, and I'm trying to
understand its guarantees. I have a few introductory questions; this is the
third of three.
I would like to do two
e of Riak's internal
workings, enumberating only the preconditions and postconditions of each
operation. We'll see how far I can get
Cheers,
John
On Jan 9, 2012, at 2:38 PM, John DeTreville wrote:
> Thanks you very much for your reply. Longer response to follow.
>
> Che
p; B through _one_ client to keep from
> reading an inconsistent state.
>
> A much simpler option, if you can bend your data, is to combine A and B into
> one object.
>
> -Ryan
>
> On Mon, Jan 9, 2012 at 12:33 AM, John DeTreville wrote:
> (An earlier post seems not t
no way to know how many. Interesting!
I'm just trying to accelerate my learning process with Riak.
Cheers,
John
On Jan 9, 2012, at 3:25 PM, John DeTreville wrote:
> Thanks for the reply, which confirms what I expected.
>
> Let me explain why I asked. I have an application tha
Excellent answer; thank you.
I imagine the unavailability I see will depend strongly on the speed of read
repairs. Since I have quite a lot of data, I imagine that they might be quite
slow, but I probably can't say more than that without real measurements.
A related question. You say that if my
That's good to know; thanks. I imagine I may have to vary my physical node
count as time goes by, and I wondering how much planning ahead that might take.
Going by your example, if my n_val is 4 and an object hashes to partition 6,
then my object will be stored only on two physical nodes, right?
That's a pity, as, if the number of physical hosts is not also a power of two,
some number of records will reside on fewer than n_val physical hosts.
Cheers,
John
On Jan 19, 2012, at 8:22 AM, Sean Cribbs wrote:
> The ring size must be a power of two because it must evenly divide 2^160 (the
>
I for one would find the availability of CRDTs to be very interesting. Good
luck!
Cheers,
John
On Jan 18, 2012, at 5:36 AM, Marek Zawirski wrote:
> thanks for your answer with a bunch of useful info. I should have introduced
> ourselves better given your replies. In fact we authored the paper
I have a simple single-threaded Java client for Riak that consistently runs out
of memory creating threads.
java.lang.OutOfMemoryError: unable to create new native thread
at java.lang.Thread.start0(Native Method)
at java.lang.Thread.start(Thread.java:658)
at
java.util.con
Excellent! I had imagined it was something like this, but it's nice to see it
in confirmed.
My real code is not so profligate with IRiakClient objects, of course, but it
was a surprise to see this pop up in JUnit tests.
Thanks very much for the quick answer.
Cheers,
John
_
12 matches
Mail list logo
