Database Paper Browser

Back to papers

Asynchronous Prefix Recoverability for Fast Distributed Stores

Summary: DPR provides asynchronous prefix recoverability for cross-shard single-key ops in a sharded cache-store, enabling sub-ms latency with prefix durability. Non-blocking rollback restores prefix-consistent state on failure; integrated in FASTER and Redis, it combines in-memory throughput with lazy durability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6259
Venue
SIGMOD
Year
2021
Pagerank
4.6657123e-05
Overall Rank
7,733 | 46.21%
DOI
10.1145/3448016.3458454

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers