Minuet: A Scalable Distributed Multiversion B-Tree

Summary: Minuet is a distributed, main-memory multiversion B-tree combining low-latency transactions with copy-on-write snapshots for in-situ analytics. Writable clones enable branching what-if analysis and replication, scaling to hundreds of cores and terabytes while scans run concurrently. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 10716
Venue: VLDB
Year: 2012
Pagerank: 5.7253247e-05
Overall Rank: 7,016 | 51.87%
DOI: 10.14778/2310919.2310921

Incoming Non-self Citations Over Time

Authors

1. Benjamin Sowell (Cornell University; Hewlett Packard Enterprise)
2. Wojciech Golab (Hewlett Packard Enterprise)
3. Mehul A. Shah (Hewlett Packard Enterprise; Nou Data)

BibTeX Citation

@article{sowell_vldb12,
        title = {{Minuet: A Scalable Distributed Multiversion B-Tree}},
        author = {Sowell, Benjamin and Golab, Wojciech and Shah, Mehul A.},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {9},
        pages = {884--895},
        doi = {10.14778/2310919.2310921},
        url = {https://doi.org/10.14778/2310919.2310921},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,235	Decibel: The Relational Dataset Branching System	2016	VLDB	8.8913373e-05
4,218	Reducing Database Locking Contention Through Multi-version Concurrency	2014	VLDB	6.8261118e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
47	PNUTS: Yahoo!'s Hosted Data Serving Platform	2008	VLDB	0.00044503718
68	The End of an Architectural Era (It’s Time for a Complete Rewrite)	2007	VLDB	0.00038446206
379	Hyder - A Transactional Record Manager for Shared Flash	2011	CIDR	0.00019611067
681	Access Methods For Multiversion Data	1989	SIGMOD	0.0001502579
807	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	1998	VLDB	0.00013884448
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,278	BATON: A Balanced Tree Structure for Peer-to-Peer Networks	2005	VLDB	8.8160706e-05
2,411	Towards Elastic Transactional Cloud Storage with Range Query Support	2010	VLDB	8.6126258e-05
3,145	Fully Persistent B+-trees	1991	SIGMOD	7.7099874e-05
3,187	P-Ring: An Efficient and Robust P2P Range Index Structure	2007	SIGMOD	7.6555242e-05
3,660	The BT-Tree: A Branched and Temporal Access Method	2000	VLDB	7.2170746e-05
7,827	Efficient B-tree Based Indexing for Cloud Data Processing	2010	VLDB	5.5361352e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,234	Epoch-based Optimistic Concurrency Control in Geo-replicated Databases	2026	SIGMOD
2	172	High-Performance Concurrency Control Mechanisms for Main-Memory Databases	2012	VLDB
3	8,475	Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees	2025	SIGMOD
4	6,396	Contention and Space Management in B-Trees	2021	CIDR
5	3,033	The Performance Of A Multiversion Access Method	1990	SIGMOD
6	10,824	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB
7	621	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB
8	7,595	Query Processing Techniques for Multiversion Access Methods	1996	VLDB
9	6,126	Efficient Bulk Updates on Multiversion B-trees	2013	VLDB
10	2,001	A Practical Scalable Distributed B-Tree	2008	VLDB