Minuet: A Scalable Distributed Multiversion B-Tree
Benjamin Sowell, Wojciech Golab, Mehul A. Shah

TL;DR
Minuet is a scalable distributed main-memory B-tree that efficiently supports both transactional operations and in-situ analytics with snapshot and writable clone features, outperforming commercial databases.
Contribution
It introduces Minuet, a novel distributed B-tree supporting multiversion concurrency, snapshots, writable clones, and high scalability for mixed transactional and analytical workloads.
Findings
Outperforms commercial main-memory databases in various metrics.
Scales to hundreds of cores and terabytes of memory.
Processes hundreds of thousands of B-tree operations per second.
Abstract
Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need both. For example, online games, socio-mobile apps, and e-commerce sites need to not only maintain operational state, but also analyze that data quickly to make predictions and recommendations that improve user experience. In this paper, we present Minuet, a distributed, main-memory B-tree that supports both transactions and copy-on-write snapshots for in-situ analytics. Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance. In addition to supporting read-only analytics queries on snapshots, Minuet supports writable clones, so that users can create branching versions of the data. This feature can be quite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Distributed systems and fault tolerance · Cloud Computing and Resource Management
