Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Strict-serializability, but at what cost, for what purpose?. Parent comment
> for scalability, this insertion process happens in batches, and the log itself is replicated and partitioned
This is the link's total exposition on this topic, but it is consistent with my reading of the Calvin paper.
If any log partition becomes unavailable, the log in its entirety becomes unavailable until that partition recovers[1].
Anyway, it feels like we’ve wasted enough of each others’ time without making much progress. Might as well leave it there.
[1] ... and every log partition must communicate with every replica, hence NxN (or MxN)
There are no comments on this comment yet.
> for scalability, this insertion process happens in batches, and the log itself is replicated and partitioned
This is the link's total exposition on this topic, but it is consistent with my reading of the Calvin paper.
If any log partition becomes unavailable, the log in its entirety becomes unavailable until that partition recovers[1].
Anyway, it feels like we’ve wasted enough of each others’ time without making much progress. Might as well leave it there.
[1] ... and every log partition must communicate with every replica, hence NxN (or MxN)