DBScholar

Back to papers

Optimistic Concurrency Control by Melding Trees

Summary: Meld: an optimistic concurrency control for tree-structured data; transactions log updates and are evaluated against a cached partial-copy of the last committed state in log order. On commit, updates merge into that state; enables Hyder to scale without partitioning, delivering up to 400k updates/s for 2-op txs and 130k for 8-op txs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10514
Venue
VLDB
Year
2011
Pagerank
6.4709622e-05
Overall Rank
4,870 | 66.59%
DOI
10.14778/3402707.3402732

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{bernstein_vldb11,
        title = {{Optimistic Concurrency Control by Melding Trees}},
        author = {Bernstein, Philip A. and Reid, Colin W. and Wu, Ming and Yuan, Xinhao},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {11},
        pages = {944--955},
        doi = {10.14778/3402707.3402732},
        url = {https://doi.org/10.14778/3402707.3402732},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
379 Hyder - A Transactional Record Manager for Shared Flash 2011 CIDR 0.00019611067
488 Design of Flash-Based DBMS: An In-Page Logging Approach 2007 SIGMOD 0.00017615543
1,731 Write-Optimized B-Trees 2004 VLDB 9.9081882e-05
2,001 A Practical Scalable Distributed B-Tree 2008 VLDB 9.3326014e-05
2,040 Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks 1995 SIGMOD 9.2704638e-05
7,737 Contest of XML Lock Protocols 2006 VLDB 5.5558475e-05
Previous Page 1 / 1 Next

Semantically Similar Papers