This paper proposes a new recovery model based on group commit, called concurrent prefix recovery (CPR). CPR differs from traditional group commit implementations in two ways: (1) it provides a semantic description of committed operations, of the form "all operations until time ti from session i"; and (2) it uses asynchronous incremental checkpointing instead of a WAL to implement group commit in a scalable bottleneck-free manner. CPR provides the same consistency as a point-in-time commit, but allows a scalable concurrent implementation. We used CPR to make two systems durable: (1) a custom in-memory transactional database; and (2) FASTER, our state-of-theart, scalable, larger-than-memory key-value store. Our detailed evaluation of these modified systems shows that CPR is highly scalable and supports concurrent performance reaching hundreds of millions of operations per second on a multi-core machine.

中文翻译：

---

并发前缀恢复

本文提出了一种基于组提交的新恢复模型，称为并发前缀恢复（CPR）。CPR 在两个方面与传统的组提交实现不同：（1）它提供了提交操作的语义描述，形式为“从会话 i 到时间 ti 的所有操作”；(2) 它使用异步增量检查点而不是 WAL 以可扩展的无瓶颈方式实现组提交。CPR 提供与时间点提交相同的一致性，但允许可扩展的并发实现。我们使用 CPR 使两个系统持久耐用：(1) 自定义内存事务数据库；(2) FASTER，我们最先进的、可扩展的、大于内存的键值存储。