DBScholar

Back to papers

Write-Optimized B-Trees

Summary: Augments conventional B-trees with optional log-structured, large-write behavior while retaining in-place updates, direct node addressing, fine-grained locking, and ACID transactions. Inexpensive online page migration also supports defragmentation, free-space consolidation, compression, and range locking. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9365
Venue
VLDB
Year
2004
Pagerank
9.9081882e-05
Overall Rank
1,731 | 88.13%
DOI
10.1016/B978-012088469-8.50060-7

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{graefe_vldb04,
        title = {{Write-Optimized B-Trees}},
        author = {Graefe, Goetz},
        journal = {PVLDB},
        series = {{VLDB} '04},
        pages = {672--683},
        doi = {10.1016/B978-012088469-8.50060-7},
        url = {https://doi.org/10.1016/B978-012088469-8.50060-7},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers