"But then don't I need to evict for every batch of writes?"
Yes, that's why I think an in-memory distributed data structure is the good
fit for your scenario. Using a log structured merged tree like C* for this
use-case is not the most efficient choice
On Sat, Nov 5, 2016 at 11:52 AM, Kant Kodali
But then don't I need to evict for every batch of writes? I thought cache
would make sense when reads/writes > 1 per say. What do you think?
On Sat, Nov 5, 2016 at 3:33 AM, DuyHai Doan wrote:
> "I have a requirement where I need to know last value that is written
> successfully so I could read t
"I have a requirement where I need to know last value that is written
successfully so I could read that value and do some computation and include
it in the subsequent write"
Maybe keeping the last written value in a distributed cache is cheaper than
doing a read before write in Cassandra ?
On Sat
I have a requirement where I need to know last value that is written
successfully so I could read that value and do some computation and include
it in the subsequent write. For now we are doing read before write which
significantly degrades the performance. Light weight transactions are more
of a c
