DBScholar

Back to papers

Concurrent Prefix Recovery: Performing CPR on a Database

Summary: CPR replaces WAL group commit with asynchronous incremental checkpointing for scalable durability. It provides semantic commit windows per session ('all ops up to ti') while preserving point-in-time consistency; validated on in-memory DB and FASTER with hundreds of millions of ops/sec. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5683
Venue
SIGMOD
Year
2019
Pagerank
5.5157734e-05
Overall Rank
7,973 | 45.30%
DOI
10.1145/3299869.3300090

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{prasaad_sigmod19,
        title = {{Concurrent Prefix Recovery: Performing CPR on a Database}},
        author = {Prasaad, Guna and Chandramouli, Badrish and Kossmann, Donald},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3300090},
        url = {https://dl.acm.org/doi/10.1145/3299869.3300090},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
3,870 FastVer: Making Data Integrity a Commodity 2021 SIGMOD 7.0604603e-05
7,717 Asynchronous Prefix Recoverability for Fast Distributed Stores 2021 SIGMOD 5.5605526e-05
8,262 It Takes Two: Instrumenting the Interaction between In-Memory Databases and Solid-State Drives 2020 CIDR 5.4574671e-05
10,574 Garnet: A Next-Generation Cache-Store for Accelerating Applications and Services 2026 VLDB 5.093636e-05
11,340 Eventual Durability 2024 VLDB 5.093636e-05
11,696 Achieving High Throughput and Elasticity in a Larger-than-Memory Store 2021 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
7 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.00083340894
38 Hekaton: SQL Server’s Memory-Optimized OLTP Engine 2013 SIGMOD 0.00047648573
157 OLTP Through the Looking Glass, and What We Found There 2008 SIGMOD 0.0002863588
473 Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores 2015 VLDB 0.00017900942
614 Faster: A Concurrent Key-Value Store with In-Place Updates 2018 SIGMOD 0.00015720975
710 Trill: A High-Performance Incremental Query Processor for Diverse Analytics 2015 VLDB 0.00014715033
1,255 Fast Checkpoint Recovery Algorithms for Frequently Consistent Applications 2011 SIGMOD 0.00011472627
2,388 Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems 2016 SIGMOD 8.6474765e-05
5,104 Redo Recovery after System Crashes 1995 VLDB 6.3641018e-05
6,265 Scalable Database Logging for Multicores 2018 VLDB 5.9356364e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 233 Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems 2015 SIGMOD
2 9,903 Recovery Protocols for Shared Memory Database Systems 1995 SIGMOD
3 8,469 Reducing Recovery Constraints on Locking based Protocols 1994 PODS
4 6,992 Consistency, Concurrency, And Crash Recovery 1978 SIGMOD
5 4,763 Rethinking Logging, Checkpoints, and Recovery for High-Performance Storage Engines 2020 SIGMOD
6 11,821 Concurrent Updates to Pages with Fixed-Size Rows Using Lock-Free Algorithms 2020 VLDB
7 2,116 A Recovery Algorithm for A High-Performance Memory-Resident Database System 1987 SIGMOD
8 9,494 Recovering from Main-Memory Lapses 1993 VLDB
9 1,255 Fast Checkpoint Recovery Algorithms for Frequently Consistent Applications 2011 SIGMOD
10 7,717 Asynchronous Prefix Recoverability for Fast Distributed Stores 2021 SIGMOD