Database Paper Browser

Back to papers

Buffered Persistence in B+ Trees

Summary: BD+Tree: buffered, epoch-based B+ tree for NVM; crash recovers to e-2; delayed, aggregated writes boost locality. Relaxed persistence reduces NVM traffic; up to 2.4x throughput; writes drop up to 99% on locality workloads; gains scale with cache. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6975
Venue
SIGMOD
Year
2024
Pagerank
4.7180617e-05
Overall Rank
7,481 | 47.96%
DOI
10.1145/3698801

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,066 DepCache: A KV Cache Management Framework for GraphRAG with Dependency Attention 2026 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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