http://cs-www.cs.yale.edu/homes/dna/papers/vldb07hstore.pdf
They pay the penalty in latency, not in throughput. That's like no performance penalty at all if you work asynchronously. They make sure that the data cannot become inconsistent between nodes by ordering the…
That's part of the proposal: real world data requirements will soon completely fit into RAM available on a rather standard system.
It's consistent, not only eventual consistent, it's k-safe, replicated and it's written to disk consistently at intervals you set. http://community.voltdb.com/node/54 (may require login). It's really pretty neat.
http://cs-www.cs.yale.edu/homes/dna/papers/vldb07hstore.pdf
They pay the penalty in latency, not in throughput. That's like no performance penalty at all if you work asynchronously. They make sure that the data cannot become inconsistent between nodes by ordering the…
That's part of the proposal: real world data requirements will soon completely fit into RAM available on a rather standard system.
It's consistent, not only eventual consistent, it's k-safe, replicated and it's written to disk consistently at intervals you set. http://community.voltdb.com/node/54 (may require login). It's really pretty neat.