Database Paper Browser

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
10323
Venue
VLDB
Year
2011
Pagerank
5.5856276e-05
Overall Rank
5,283 | 63.25%
DOI
-

Incoming Non-self Citations Over Time

Authors

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
345 Design of Flash-Based DBMS: An In-Page Logging Approach 2007 SIGMOD 0.00026677681
521 Hyder - A Transactional Record Manager for Shared Flash 2011 CIDR 0.00021139547
1,480 Write-Optimized B-Trees 2004 VLDB 0.00011746722
1,985 A Practical Scalable Distributed B-Tree 2008 VLDB 9.8569956e-05
2,207 Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks 1995 SIGMOD 9.2905883e-05
7,353 Contest of XML Lock Protocols 2006 VLDB 4.7533776e-05
Previous Page 1 / 1 Next

Semantically Similar Papers