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: hcd079e459ad07e67
Venue: SIGMOD
Year: 2019
Pagerank: 5.3920142e-05
Overall Rank: 8,140 | 45.28%
DOI: 10.1145/3299869.3300090

Incoming Non-self Citations Over Time

Authors

1. Guna Prasaad (University of Washington)
2. Badrish Chandramouli (Microsoft)
3. Donald Kossmann (Microsoft)

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,897	FastVer: Making Data Integrity a Commodity	2021	SIGMOD	6.9373769e-05
7,874	Asynchronous Prefix Recoverability for Fast Distributed Stores	2021	SIGMOD	5.4357887e-05
8,428	It Takes Two: Instrumenting the Interaction between In-Memory Databases and Solid-State Drives	2020	CIDR	5.3350162e-05
10,783	Garnet: A Next-Generation Cache-Store for Accelerating Applications and Services	2026	VLDB	4.9793485e-05
11,658	Eventual Durability	2024	VLDB	4.9793485e-05
12,001	Achieving High Throughput and Elasticity in a Larger-than-Memory Store	2021	VLDB	4.9793485e-05

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.00081992507
35	Hekaton: SQL Server’s Memory-Optimized OLTP Engine	2013	SIGMOD	0.00048001919
157	OLTP Through the Looking Glass, and What We Found There	2008	SIGMOD	0.00028317906
445	Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores	2015	VLDB	0.00018176701
546	Faster: A Concurrent Key-Value Store with In-Place Updates	2018	SIGMOD	0.00016590738
685	Trill: A High-Performance Incremental Query Processor for Diverse Analytics	2015	VLDB	0.00014782777
1,259	Fast Checkpoint Recovery Algorithms for Frequently Consistent Applications	2011	SIGMOD	0.00011297239
2,378	Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems	2016	SIGMOD	8.5493291e-05
5,221	Redo Recovery after System Crashes	1995	VLDB	6.2214691e-05
6,329	Scalable Database Logging for Multicores	2018	VLDB	5.8129197e-05

Semantically Similar Papers

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