Open GoogleCodeExporter opened 8 years ago
Yes, we could implement something similar in the meantime. In the long term, we
plan to also distinguish read and write majorities.
Most important is, that read and write sets are overlapping by at least one
replica for strong consistency.
If you want faster reads than writes you can decrease the read majority and
increase the required write majority accordingly and vice versa. So the
spectrum of possibilities that Scalaris can offer, is not simply put into some
static formulas.
Nevertheless, your proposed configuration probably will be the most common and
a section on it in the documentation would help to understand the technology
more easily.
Original comment by schin...@gmail.com
on 26 Aug 2010 at 10:17
>If you want faster reads than writes you can decrease the read majority and
increase
>the required write majority accordingly and vice versa. So the spectrum of
>possibilities that Scalaris can offer, is not simply put into some static
formulas.
But in this case the base will lose consistency and partition tolerance
properties...
Original comment by serge.po...@gmail.com
on 26 Aug 2010 at 12:37
No, still for each operation there would be at least one replica in each read
set
that is also in a write set.
replicas = 4, write majority = 3, read majority = 2
replicas = 5, write majority = 4, read majority = 2
write majority + read majority > replicas
Original comment by schin...@gmail.com
on 26 Aug 2010 at 4:06
Ok, I see your point. But when we increase the write majority we simultaneously
reduce the fault tolerance property. So some table with such dependenes should
be in the documentation.
Original comment by serge.po...@gmail.com
on 27 Aug 2010 at 10:00
Original issue reported on code.google.com by
serge.po...@gmail.com
on 9 Aug 2010 at 1:08