Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3422648.3422653 | Special Interest Group on Management of Data |
DocType | Volume | Issue |
Journal | 49 | 1 |
ISSN | Citations | PageRank |
0163-5808 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guna Prasaad | 1 | 6 | 2.81 |
| Badrish Chandramouli | 2 | 522 | 42.85 |
| Donald Kossmann | 3 | 6220 | 603.55 |